Reducing Key Length of the McEliece Cryptosystem
From MaRDI portal
Publication:3637133
DOI10.1007/978-3-642-02384-2_6zbMath1246.94022OpenAlexW1520077026WikidataQ62039177 ScholiaQ62039177MaRDI QIDQ3637133
Pierre-Louis Cayrel, Ayoub Otmani, Philippe Gaborit, Thierry P. Berger
Publication date: 7 July 2009
Published in: Progress in Cryptology – AFRICACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02384-2_6
Related Items (36)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ Reducing the Key Size of Rainbow Using Non-commutative Rings ⋮ New Variant of the McEliece Cryptosystem ⋮ Basics of Secrecy Coding ⋮ Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ ECC\(^2\): error correcting code and elliptic curve based cryptosystem ⋮ Properties of constacyclic codes under the Schur product ⋮ Weaknesses in Two RFID Authentication Protocols ⋮ Square Code Attack on a Modified Sidelnikov Cryptosystem ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ The syndromes decoding algorithm in group codes ⋮ On new problems in asymmetric cryptography based on error-resistant coding ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ A code-based hybrid signcryption scheme ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Quantum Cryptography: Key Distribution and Beyond ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes ⋮ Dihedral codes with prescribed minimum distance ⋮ Reproducible families of codes and cryptographic applications ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ On quasi-cyclic codes as a generalization of cyclic codes ⋮ A Multivariate Encryption Scheme with Rainbow ⋮ Wild McEliece ⋮ A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem ⋮ Monoidic Codes in Cryptography ⋮ Statistical Decoding of Codes over $\mathbb{F}_q$ ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes ⋮ On checkable codes in group algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- On the concatenated structure of a linear code
- Attacking and Defending the McEliece Cryptosystem
- McEliece Cryptosystem Implementation: Theory and Practice
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- A public-key cryptosystem based on binary Reed-Muller codes
- On the inherent intractability of certain coding problems (Corresp.)
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key 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
- A Summary of McEliece-Type Cryptosystems and their Security
- On Kabatianskii-Krouk-Smeets Signatures
- Cryptanalysis of the Sidelnikov Cryptosystem
This page was built for publication: Reducing Key Length of the McEliece Cryptosystem
