McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes
Designs, Codes and Cryptography
Journal of Symbolic Computation - Special issue on applications of the Gröbner basis method
Algebraic-Geometric Codes
The Construction of Multivariate Polynomials with Preassigned Zeros
EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
How to Mask the Structure of Codes for a Cryptographic Use
Designs, Codes and Cryptography
Algebraic Function Fields and Codes
Algebraic Function Fields and Codes
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of the niederreiter public key scheme based on GRS subcodes
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
An attack on a modified niederreiter encryption scheme
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
On the decoding of algebraic-geometric codes
IEEE Transactions on Information Theory - Part 1
Which linear codes are algebraic-geometric?
IEEE Transactions on Information Theory
The non-gap sequence of a subcode of a generalized Reed---Solomon code
Designs, Codes and Cryptography
Hi-index | 0.00 |
This paper addresses the question of retrieving the triple $${(\mathcal X,\mathcal P, E)}$$ from the algebraic geometry code $${\mathcal C = \mathcal C_L(\mathcal X, \mathcal P, E)}$$, where $${\mathcal X}$$ is an algebraic curve over the finite field $${\mathbb F_q, \,\mathcal P}$$ is an n-tuple of $${\mathbb F_q}$$-rational points on $${\mathcal X}$$ and E is a divisor on $${\mathcal X}$$. If $${\deg(E)\geq 2g+1}$$ where g is the genus of $${\mathcal X}$$, then there is an embedding of $${\mathcal X}$$ onto $${\mathcal Y}$$ in the projective space of the linear series of the divisor E. Moreover, if $${\deg(E)\geq 2g+2}$$, then $${I(\mathcal Y)}$$, the vanishing ideal of $${\mathcal Y}$$, is generated by $${I_2(\mathcal Y)}$$, the homogeneous elements of degree two in $${I(\mathcal Y)}$$. If $${n 2 \deg(E)}$$, then $${I_2(\mathcal Y)=I_2(\mathcal Q)}$$, where $${\mathcal Q}$$ is the image of $${\mathcal P}$$ under the map from $${\mathcal X}$$ to $${\mathcal Y}$$. These three results imply that, if $${2g+2\leq m , an AG representation $${(\mathcal Y, \mathcal Q, F)}$$ of the code $${\mathcal C}$$ can be obtained just using a generator matrix of $${\mathcal C}$$ where $${\mathcal Y}$$ is a normal curve in $${\mathbb{P}^{m-g}}$$ which is the intersection of quadrics. This fact gives us some clues for breaking McEliece cryptosystem based on AG codes provided that we have an efficient procedure for computing and decoding the representation obtained.