Attacking and Defending the McEliece Cryptosystem
From MaRDI portal
Recommendations
Cites work
- 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 probabilistic algorithm for computing minimum weights of large error-correcting codes
- A Summary of McEliece-Type Cryptosystems and their Security
- Code-based cryptography
- scientific article; zbMATH DE number 4179278 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- scientific article; zbMATH DE number 2154508 (Why is no real title available?)
- List Decoding for Binary Goppa Codes
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- The algebraic decoding of Goppa codes
- The minimum number of edges in graphs with prescribed paths
Cited in
(74)- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Encryption scheme based on expanded Reed-Solomon codes
- On the dimension of the subfield subcodes of 1-point Hermitian codes
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- On the design and security of Lee metric McEliece cryptosystems
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- A new code-based cryptosystem
- Toward secure implementation of McEliece decryption
- Computational aspects of retrieving a representation of an algebraic geometry code
- Structural cryptanalysis of McEliece schemes with compact keys
- Using low-density parity-check codes to improve the McEliece cryptosystem
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- scientific article; zbMATH DE number 1583808 (Why is no real title available?)
- Enhanced public key security for the McEliece cryptosystem
- Vulnerabilities of ``McEliece in the world of Escher
- Broadcast attacks against code-based schemes
- List Decoding for Binary Goppa Codes
- Faster 2-regular information-set decoding
- scientific article; zbMATH DE number 2085434 (Why is no real title available?)
- Wild McEliece
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Decoding one out of many
- Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Practical cryptanalysis of ISO 9796-2 and EMV signatures
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Quantum resistant public key encryption scheme polarRLCE
- Improved information set decoding for code-based cryptosystems with constrained memory
- Basics of secrecy coding
- On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- Reducing Key Length of the McEliece Cryptosystem
- The dual geometry of Hermitian two-point codes
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- Cryptanalysis of McEliece’s Public-Key Cryptosystem
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- 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
- How to avoid the Sidel'nikov-Shestakov attack
- scientific article; zbMATH DE number 2154505 (Why is no real title available?)
- An efficient attack of a McEliece cryptosystem variant based on convolutional codes
- Error-correction of linear codes via colon ideals
- On the generating matrices of Goppa codes over hyperelliptic curves
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- Syndrome Decoding Estimator
- Quantum cryptography: key distribution and beyond
- Smaller decoding exponents: ball-collision decoding
- Polynomial time attack on wild McEliece over quadratic extensions
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- TinyKeys: a new approach to efficient multi-party computation
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
- Breaking Goppa-based McEliece with hints
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Decoding McEliece with a hint -- secret Goppa key parts reveal everything
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- New attacks on LowMC instances with a single plaintext/ciphertext pair
- On new problems in asymmetric cryptography based on error-resistant coding
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
- On two modifications of the McEliece PKE and the CFS signature scheme
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- Integer syndrome decoding in the presence of noise
- CryptAttackTester: high-assurance attack analysis
- A McEliece cryptosystem using permutation codes
- Increasing index sizes for information set decoding algorithms
- Distributed matrix multiplication with straggler tolerance over very small fields
- Higher-genus McEliece
- On breaking McEliece keys using brute force
- The May-Ozerov algorithm for syndrome decoding is ``galactic
- Computer algebra tales on Goppa codes and McEliece cryptography
- Information set decoding in the Lee metric with applications to cryptography
This page was built for publication: Attacking and Defending the McEliece Cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535349)
