Quasi-Dyadic CFS Signatures
- Cite this paper as:
- Barreto P.S.L.M., Cayrel PL., Misoczki R., Niebuhr R. (2011) Quasi-Dyadic CFS Signatures. In: Lai X., Yung M., Lin D. (eds) Information Security and Cryptology. Inscrypt 2010. Lecture Notes in Computer Science, vol 6584. Springer, Berlin, Heidelberg
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.
Keywordspost-quantum cryptography coding-based cryptography digital signatures efficient parameters and algorithms
Unable to display preview. Download preview PDF.