On the matrix code of quadratic relationships for a Goppa code
From MaRDI portal
Cites work
- 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
- 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})\)
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Grover vs. McEliece
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- On computing nearest neighbors with applications to decoding of binary linear codes
- On products and powers of linear codes under componentwise multiplication
- On the dimension and structure of the square of the dual of a Goppa code
- On the edge-independence number and edge-covering number for regular graphs
- Polynomial time key-recovery attack on high rate random alternant codes
- Quantum information set decoding algorithms
- The algebraic decoding of Goppa codes
- The automorphism groups of Reed-Solomon codes
- Two decoding algorithms for linear codes
- Weak keys in the McEliece public-key cryptosystem
This page was built for publication: On the matrix code of quadratic relationships for a Goppa code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025891)