Quasi-Dyadic CFS Signatures

@inproceedings{Barreto2010QuasiDyadicCS,
  title={Quasi-Dyadic CFS Signatures},
  author={Paulo S. L. M. Barreto and Pierre-Louis Cayrel and Rafael Misoczki and Robert Niebuhr},
  booktitle={Inscrypt},
  year={2010}
}
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. 

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Code Based Cryptography and Steganography

CAI • 2013
View 11 Excerpts
Highly Influenced

Attacking and Defending Code-based Cryptosystems

Wissenschaftlicher Werdegang
2012
View 9 Excerpts
Highly Influenced

Efficient Digital Signatures From Coding Theory

IACR Cryptology ePrint Archive • 2017
View 1 Excerpt

A Quantum-classical Hybrid Architecture for Security Algorithms Acceleration

2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications • 2012
View 3 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Similar Papers

Loading similar papers…