Quasi-dyadic CFS signatures

Abstract : Courtois-Finiasz-Sendrier (CFS) digital signatures critically depend on the ability to efficiently find a decodable syndrome by random sampling the syndrome space, previously restricting the class of codes upon which they could be instantiated to generic binary Goppa codes. In this paper we show how to construct t-error correcting quasi-dyadic codes where the density of decodable syndromes is high, while also allowing for a reduction by a factor up to t in the key size.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00870939
Contributor : Rafael Misoczki <>
Submitted on : Tuesday, October 8, 2013 - 2:53:29 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: Friday, April 7, 2017 - 8:29:11 AM

File

online.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00870939, version 1

Collections

Citation

Paulo S. L. M. Barreto, Pierre-Louis Cayrel, Rafael Misoczki, Niehbur Robert. Quasi-dyadic CFS signatures. 6th International Conference Information Security and Cryptology, Oct 2010, Shangai, China. ⟨hal-00870939⟩

Share

Metrics

Record views

208

Files downloads

312