A new approach based on quadratic forms to attack the McEliece cryptosystem
From MaRDI portal
Publication:6604863
DOI10.1007/978-981-99-8730-6_1zbMATH Open1547.94344MaRDI QIDQ6604863
Rocco Mora, Alain Couvreur, Jean-Pierre Tillich
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of MDS codes that have an error correcting pair
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- New identities relating wild Goppa codes
- Two decoding algorithms for linear codes
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- An efficient structural attack on NIST submission DAGS
- Quantum information set decoding algorithms
- DAGS: key encapsulation using dyadic GS codes
- On the complexity of ``Superdetermined minrank instances
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Squares of Random Linear Codes
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Algorithm 923
- Wild McEliece
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Monoidic Codes in Cryptography
- Wild McEliece Incognito
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Grover vs. McEliece
- Cryptanalysis of MinRank
- Reducing Key Length of the McEliece Cryptosystem
- Compact McEliece Keys from Goppa Codes
- Solving sparse linear equations over finite fields
- A method for obtaining digital signatures and public-key cryptosystems
- On the edge-independence number and edge-covering number for regular graphs
- 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
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Weak keys in the McEliece public-key cryptosystem
- Combinatorial Commutative Algebra
- A Distinguisher for High-Rate McEliece Cryptosystems
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- A new approach based on quadratic forms to attack the McEliece cryptosystem
Related Items (1)
This page was built for publication: A new approach based on quadratic forms to attack the McEliece cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604863)
