Paper 2021/396 Original: eprint.iacr.org/2021/396 ↗
LESS-FM: Fine-tuning Signatures from the Code Equivalence Problem
Abstract
Code-based cryptographic schemes are highly regarded among the quantum-safe alternatives to current standards. Yet, designing code-based signatures using traditional methods has always been a challenging task, and current proposals are still far from the target set by other post-quantum primitives (e.g. lattice-based). In this paper, we revisit a recent work using an innovative approach for signing, based on the hardness of the code equivalence problem. We introduce some optimizations and provide a security analysis for all variants considered. We then show that the new parameters produce instances of practical interest.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2021-08-12: last updated
- 2021-03-27: published
- Short URL
- https://ia.cr/2021/396
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/396,
author = {Alessandro Barenghi and Jean-Francois Biasse and Edoardo Persichetti and Paolo Santini},
title = {LESS-FM: Fine-tuning Signatures from the Code Equivalence Problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/396},
year = {2021},
url = {https://eprint.iacr.org/2021/396}
}