Enhanced public key security for the McEliece cryptosystem
From MaRDI portal
Publication:271573
DOI10.1007/s00145-014-9187-8zbMath1351.94024arXiv1108.2462OpenAlexW2151025885WikidataQ125019114 ScholiaQ125019114MaRDI QIDQ271573
F. Blanchet-Sadri, M. Dambrine
Publication date: 7 April 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2462
Reed-Solomon codeserror correcting codesMcEliece cryptosystemNiederreiter cryptosystempublic key security
Related Items (15)
Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes ⋮ Generalization of the Ball-Collision Algorithm ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ The syndromes decoding algorithm in group codes ⋮ Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem ⋮ On the security of a Loidreau rank metric code based encryption scheme ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Quantum Resistant Public Key Encryption Scheme polarRLCE ⋮ Encryption scheme based on expanded Reed-Solomon codes ⋮ On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes ⋮ Mathematical models of modified crypto-code means of information protection based on coding theory schemes ⋮ Rank-Metric Codes and Their Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of MDS codes that have an error correcting pair
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- Column scrambler for the GPT cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- How to mask the structure of codes for a cryptographic use
- McBits: Fast Constant-Time Code-Based Cryptography
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
- A CCA2 Secure Variant of the McEliece Cryptosystem
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Wild McEliece Incognito
- Attacking and Defending the McEliece Cryptosystem
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Information-Set Decoding for Linear Codes over F q
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- On the inherent intractability of certain coding problems (Corresp.)
- On the edge-independence number and edge-covering number for regular graphs
- How to avoid the Sidel'nikov-Shestakov attack
- Secure integration of asymmetric and symmetric encryption schemes
- Smaller Decoding Exponents: Ball-Collision Decoding
- A Distinguisher for High-Rate McEliece Cryptosystems
This page was built for publication: Enhanced public key security for the McEliece cryptosystem
