Quasi-dyadic CFS signatures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Quasi-dyadic CFS signatures


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.
Fichier principal
Vignette du fichier
online.pdf (520.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00870939 , version 1 (08-10-2013)


  • HAL Id : hal-00870939 , version 1


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⟩


121 View
372 Download


Gmail Facebook X LinkedIn More