Quasi-cyclic Linear Error-Block Code-based Post-quantum Signature
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910899128762368 |
|---|---|
| author | Cherkaoui, I. Belabssir, S. Horgan, J. Dey, I. |
| author_facet | Cherkaoui, I. Belabssir, S. Horgan, J. Dey, I. |
| contents | Shor algorithm led to the discovery of multiple vulnerabilities in a number of cryptosystems. As a result, post-quantum cryptography attempts to provide cryptographic solutions that can face these attacks, ensuring the security of sensitive data in a future where quantum computers are assumed to exist. Error correcting codes are a source for efficiency when it comes to signatures, especially random ones described in this paper, being quantum-resistant and reaching the Gilbert-Varshamov bound, thus offering a good trade-off between rate and distance. In the light of this discussion, we introduce a signature based on a family of linear error-block codes (LEB), with strong algebraic properties: it is the family of quasi-cyclic LEB codes that we do define algebraically during this work. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_23405 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quasi-cyclic Linear Error-Block Code-based Post-quantum Signature Cherkaoui, I. Belabssir, S. Horgan, J. Dey, I. Quantum Physics Information Theory Shor algorithm led to the discovery of multiple vulnerabilities in a number of cryptosystems. As a result, post-quantum cryptography attempts to provide cryptographic solutions that can face these attacks, ensuring the security of sensitive data in a future where quantum computers are assumed to exist. Error correcting codes are a source for efficiency when it comes to signatures, especially random ones described in this paper, being quantum-resistant and reaching the Gilbert-Varshamov bound, thus offering a good trade-off between rate and distance. In the light of this discussion, we introduce a signature based on a family of linear error-block codes (LEB), with strong algebraic properties: it is the family of quasi-cyclic LEB codes that we do define algebraically during this work. |
| title | Quasi-cyclic Linear Error-Block Code-based Post-quantum Signature |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2503.23405 |