Parallel-CFS Strengthening the CFS McEliece-Based Signature Scheme

Saved in:
Bibliographic Details
Title: Parallel-CFS Strengthening the CFS McEliece-Based Signature Scheme
Authors: Matthieu Finiasz
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://www-rocq.inria.fr/codes/Matthieu.Finiasz/research/2010/finiasz-sac10.pdf.
Collection: CiteSeerX
Subject Terms: code based cryptography, Syndrome Decoding problem
Description: This article presents a modification of the CFS code based signature scheme. By producing two (or more generally i) signatures in parallel, we show that it is possible to protect this scheme from “one out of many ” decoding attacks. With this modification, and at the cost of slightly larger signatures, it is possible to use smaller parameters for the CFS signature, thus making this new Parallel-CFS construction more practical than standard CFS signatures.
Document Type: text
File Description: application/pdf
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.171.670
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.171.670
http://www-rocq.inria.fr/codes/Matthieu.Finiasz/research/2010/finiasz-sac10.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.8C472276
Database: BASE
Description
Abstract:This article presents a modification of the CFS code based signature scheme. By producing two (or more generally i) signatures in parallel, we show that it is possible to protect this scheme from “one out of many ” decoding attacks. With this modification, and at the cost of slightly larger signatures, it is possible to use smaller parameters for the CFS signature, thus making this new Parallel-CFS construction more practical than standard CFS signatures.