Distinguishing Goppa codes using higher-order vanishing
From MaRDI portal
Cites work
- 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})\)
- scientific article; zbMATH DE number 6488188 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- Inverse system of a symbolic power. I
- Krawtchouk polynomials and quadratic semi-regular sequences
- On the dimension and structure of the square of the dual of a Goppa code
- On the inherent intractability of certain coding problems (Corresp.)
- Polynomial time key-recovery attack on high rate random alternant codes
- Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
- Semi-regularity of pairs of Boolean polynomials
- Solving sparse linear equations over finite fields
- Squares of Random Linear Codes
This page was built for publication: Distinguishing Goppa codes using higher-order vanishing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447186)