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 QIDQ6604863FDOQ6604863
Authors: Alain Couvreur, Rocco Mora, Jean-Pierre Tillich 
Publication date: 13 September 2024
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Combinatorial Commutative Algebra
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Monoidic codes in cryptography
- Algebraic cryptanalysis of McEliece variants with compact keys
- Reducing Key Length of the McEliece Cryptosystem
- Compact McEliece keys from Goppa codes
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A Distinguisher for High-Rate McEliece Cryptosystems
- A characterization of MDS codes that have an error correcting pair
- Wild McEliece Incognito
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- On the edge-independence number and edge-covering number for regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving sparse linear equations over finite fields
- Algorithm 923
- Title not available (Why is that?)
- Grover vs. McEliece
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Cryptanalysis of MinRank
- Wild McEliece
- On the complexity of the \(F_5\) Gröbner basis algorithm
- New identities relating wild Goppa codes
- An efficient structural attack on NIST submission DAGS
- DAGS: key encapsulation using dyadic GS codes
- Squares of Random Linear Codes
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Two decoding algorithms for linear codes
- Quantum information set decoding algorithms
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- On the complexity of ``Superdetermined minrank instances
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
- A new approach based on quadratic forms to attack the McEliece cryptosystem
Cited In (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)
