Paper 2017/397
Efficient One-Time Signatures from Quasi-Cyclic Codes: a Full Treatment
Edoardo Persichetti
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.
Note: Forgot to compile bibliography.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- SignatureCoding TheoryIdentification
- Contact author(s)
- epersichetti @ fau edu
- History
- 2018-09-24: last of 4 revisions
- 2017-05-09: received
- See all versions
- Short URL
- https://ia.cr/2017/397
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/397,
author = {Edoardo Persichetti},
title = {Efficient One-Time Signatures from Quasi-Cyclic Codes: a Full Treatment},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/397},
year = {2017},
url = {https://eprint.iacr.org/2017/397}
}
