Parallel-CFS
From MaRDI portal
Publication:3084252
DOI10.1007/978-3-642-19574-7_11zbMath1292.94062MaRDI QIDQ3084252
Publication date: 15 March 2011
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_11
Related Items
Code-Based Signature Schemes from Identification Protocols in the Rank Metric, Quantum-assisted QD-CFS signatures, A correction to a code-based blind signature scheme, Decoding One Out of Many, Monoidic Codes in Cryptography, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List Decoding for Binary Goppa Codes
- McEliece Cryptosystem Implementation: Theory and Practice
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Security Bounds for the Design of Code-Based Cryptosystems
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- On the complexity of some cryptographic problems based on the general decoding problem
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme