On the dimension and structure of the square of the dual of a Goppa code
From MaRDI portal
Publication:2697482
DOI10.1007/s10623-022-01153-wOpenAlexW3215246204MaRDI QIDQ2697482
Rocco Mora, Jean-Pierre Tillich
Publication date: 12 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.13038
Goppa codesalternant codescode-based cryptographysquare codesalgebraic codesdistinguisher of Goppa codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (2)
A code-based hybrid signcryption scheme ⋮ On linear codes with random multiplier vectors and the maximum trace dimension property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Quantum information set decoding algorithms
- On products and powers of linear codes under componentwise multiplication
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- 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
- Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- The algebraic decoding of Goppa codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- 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 Distinguisher for High-Rate McEliece Cryptosystems
This page was built for publication: On the dimension and structure of the square of the dual of a Goppa code