A new approach based on quadratic forms to attack the McEliece cryptosystem
From MaRDI portal
Publication:6604863
Recommendations
Cites work
- scientific article; zbMATH DE number 1583768 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- A Distinguisher for High-Rate McEliece Cryptosystems
- A characterization of MDS codes that have an error correcting pair
- A method for obtaining digital signatures and 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 new approach based on quadratic forms to attack the McEliece cryptosystem
- Algebraic attack against variants of McEliece with Goppa polynomial of a special form
- Algebraic cryptanalysis of McEliece variants with compact keys
- Algorithm 923: Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
- An efficient structural attack on NIST submission DAGS
- Analysis of information set decoding for a sub-linear error weight
- Combinatorial Commutative Algebra
- Compact McEliece keys from Goppa codes
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Cryptanalysis of MinRank
- DAGS: key encapsulation using dyadic GS codes
- 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})\)
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Grover vs. McEliece
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Monoidic codes in cryptography
- New identities relating wild Goppa codes
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the complexity of ``Superdetermined minrank instances
- On the complexity of the \(F_5\) Gröbner basis algorithm
- On the edge-independence number and edge-covering number for regular graphs
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Quantum information set decoding algorithms
- Reducing Key Length of the McEliece Cryptosystem
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- Solving sparse linear equations over finite fields
- Squares of Random Linear Codes
- Two decoding algorithms for linear codes
- Weak keys in the McEliece public-key cryptosystem
- Wild McEliece
- Wild McEliece Incognito
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)
