Computational aspects of retrieving a representation of an algebraic geometry code
From MaRDI portal
Publication:2437321
DOI10.1016/j.jsc.2013.12.007zbMath1286.14041MaRDI QIDQ2437321
Pellikaan, Ruud, Irene Márquez-Corbella, Edgar Martínez-Moro, Diego Ruano
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.12.007
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
14G50: Applications to coding theory and cryptography of arithmetic geometry
Uses Software
Cites Work
- The extended \(k\)-tree algorithm
- On the structure of order domains
- On Petri's analysis of the linear system of quadrics through a canonical curve
- Finding irreducible and primitive polynomials
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- A Gröbner basis criterion for birational equivalence of affine varieties
- Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve
- McEliece public key cryptosystems using algebraic-geometric codes
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- Multiplication matrices and ideals of projective dimension zero
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- How to mask the structure of codes for a cryptographic use
- 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})$
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- A standard basis approach to syzygies of canonical curves.
- Which linear codes are algebraic-geometric?
- Attacking and Defending the McEliece Cryptosystem
- Side Channels in the McEliece PKC
- Algebraic Function Fields and Codes
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Algebraic Cryptanalysis of McEliece Variants with Compact Keys
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Reducing Key Length of the McEliece Cryptosystem
- MicroEliece: McEliece for Embedded Devices
- Security Bounds for the Design of Code-Based Cryptosystems
- Compact McEliece Keys from Goppa Codes
- A public-key cryptosystem based on binary Reed-Muller codes
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's 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
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Weak keys in the McEliece public-key cryptosystem
- On the decoding of algebraic-geometric codes
- Effective construction of algebraic geometry codes
- An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes
- Smaller Decoding Exponents: Ball-Collision Decoding
- Unique Decoding of Plane AG Codes via Interpolation
- Improved Two-Point Codes on Hermitian Curves
- A Distinguisher for High-Rate McEliece Cryptosystems
- Cryptanalysis of the Sidelnikov Cryptosystem
- Progress in Cryptology – Mycrypt 2005
- Varieties Defined by Quadratic Equations
- Algorithme de Brill-Noether et codes de Goppa
- An Arithmetic Theory of Adjoint Plane Curves
- Public Key Cryptography - PKC 2006
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
