Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
Open Access
- 12 October 2018
- journal article
- research article
- Published by MDPI AG in Cryptography
- Vol. 2 (4) , 30
Abstract
The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. This paper is the full version of a work appeared at SIN’18 as a short paper, which introduced a simple and efficient one-time secure signature scheme based on quasi-cyclic codes. As such, this paper features, in a fully self-contained way, an accurate description of the scheme setting and related previous work, a detailed security analysis, and an extensive comparison and performance discussion.Keywords
This publication has 22 references indexed in Scilit:
- One-time signature scheme from syndrome decoding over generic error-correcting codesJournal of Systems and Software, 2011
- Post-Quantum Cryptography2011
- Post-Quantum Cryptography2009
- On Kabatianskii-Krouk-Smeets Signatures2007
- Security Arguments for Digital Signatures and Blind SignaturesJournal of Cryptology, 2000
- Improved identification schemes based on error-correcting codesApplicable Algebra in Engineering, Communication and Computing, 1997
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- Some results on quasi-cyclic codesInformation and Control, 1969
- The use of information sets in decoding cyclic codesIEEE Transactions on Information Theory, 1962