Chapter

Information Security and Cryptology

Volume 6584 of the series Lecture Notes in Computer Science pp 336-349

Quasi-Dyadic CFS Signatures

  • Paulo S. L. M. BarretoAffiliated withLancaster UniversityDepartamento de Engenharia de Computação e Sistemas Digitais (PCS), Escola Politécnica, Universidade de São Paulo
  • , Pierre-Louis CayrelAffiliated withCarnegie Mellon UniversityCASED – Center for Advanced Security Research Darmstadt
  • , Rafael MisoczkiAffiliated withLancaster UniversityDepartamento de Engenharia de Computação e Sistemas Digitais (PCS), Escola Politécnica, Universidade de São Paulo
  • , Robert NiebuhrAffiliated withCarnegie Mellon UniversityFachbereich Informatik Kryptographie und Computeralgebra, Technische Universität Darmstadt

* Final gross prices may vary according to local VAT.

Get Access

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