International Conference on Information Security and Cryptology

Inscrypt 2010: Information Security and Cryptology pp 336-349

Quasi-Dyadic CFS Signatures

  • Paulo S. L. M. Barreto
  • Pierre-Louis Cayrel
  • Rafael Misoczki
  • Robert Niebuhr
Conference paper

DOI: 10.1007/978-3-642-21518-6_23

Volume 6584 of the book series Lecture Notes in Computer Science (LNCS)
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

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.

Keywords

post-quantum cryptography coding-based cryptography digital signatures efficient parameters and algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Paulo S. L. M. Barreto
    • 1
  • Pierre-Louis Cayrel
    • 2
  • Rafael Misoczki
    • 1
  • Robert Niebuhr
    • 3
  1. 1.Departamento de Engenharia de Computação e Sistemas Digitais (PCS)Escola Politécnica, Universidade de São PauloBrazil
  2. 2.CASED – Center for Advanced Security Research DarmstadtDarmstadtGermany
  3. 3.Fachbereich Informatik Kryptographie und ComputeralgebraTechnische Universität DarmstadtDarmstadtGermany