Paper 2023/1956
A Signature Scheme from Full-Distance Syndrome Decoding
Abstract
In this paper we propose a new hash-and-sign digital signature scheme whose security against existential forgery under adaptive chosen message attack is based on the hardness of full-distance syndrome decoding. We propose parameter sets for three security levels (128-bits, 192-bits, and 256-bits) based on concrete estimations for hardness of the syndrome decoding problem and estimate the corresponding sizes of the keys and the signature for each level. The scheme has large public and private keys but very small signatures.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Digital SignatureCode-Based CryptographySyndrome Decoding Problem
- Contact author(s)
- haliem abbas @ gmail com
- History
- 2023-12-25: approved
- 2023-12-24: received
- See all versions
- Short URL
- https://ia.cr/2023/1956
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2023/1956, author = {Abdelhaliem Babiker}, title = {A Signature Scheme from Full-Distance Syndrome Decoding}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1956}, year = {2023}, url = {https://eprint.iacr.org/2023/1956} }