Post-quantum cryptography: Code-based signatures
From MaRDI portal
Abstract: This survey provides a comparative overview of code-based signature schemes with respect to security and performance. Furthermore, we explicitly describe serveral code-based signature schemes with additional properties such as identity-based, threshold ring and blind signatures.
Recommendations
- Post-quantum cryptography: lattice signatures
- DAGS: key encapsulation using dyadic GS codes
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- LESS-FM: fine-tuning signatures from the code equivalence problem
Cited in
(16)- On the security of the Courtois-Finiasz-Sendrier signature
- Cryptanalysis of a code-based full-time signature
- Provably secure identity-based identification and signature schemes with parallel-PVR
- LESS-FM: fine-tuning signatures from the code equivalence problem
- Verifying post-quantum signatures in 8 kB of RAM
- Post-quantum EPID signatures from symmetric primitives
- Post-quantum cryptography: lattice signatures
- Post-quantum cryptography: lattice identification schemes
- scientific article; zbMATH DE number 7259165 (Why is no real title available?)
- LESS is more: code-based signatures without syndromes
- 14 Code-based post-quantum cryptographic technique: digital signature
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Take your MEDS: digital signatures from matrix code equivalence
- CSH: A Post-quantum Secret Handshake Scheme from Coding Theory
- Patent landscape in the field of hash-based post-quantum signatures (invited paper)
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
This page was built for publication: Post-quantum cryptography: Code-based signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578098)