Implementing CFS

Abstract : CFS is the first practical code-based signature scheme. In the present paper, we present the initial scheme and its evolutions, the attacks it had to face and the countermeasures applied. We compare the different algorithmic choices involved during the implementation of the scheme and aim to provide guidelines to this task. We will show that all things considered the system remains practical. Finally, we present a state-of-the-art software implementation of the signing primitive to prove our claim. For eighty bits of security our implementation produces a signature in 1.3 seconds on a single core of Intel Xeon W3670 at 3.20 GHz. Moreover the computation is easy to distribute and we can take full profit of multi-core processors reducing the signature time to a fraction of second in software.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00880644
Contributor : Grégory Landais <>
Submitted on : Wednesday, November 6, 2013 - 3:30:28 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM

Identifiers

Collections

Citation

Grégory Landais, Nicolas Sendrier. Implementing CFS. INDOCRYPT 2012 - 13th International Conference on Cryptology in India, Dec 2012, Kolkata, India. pp.474-488, ⟨10.1007/978-3-642-34931-7_27⟩. ⟨hal-00880644⟩

Share

Metrics

Record views

172