The Tangent Space Attack
Author:
Preprint
Abstract
We propose a new method for retrieving the algebraic structure of a generic alternant code given an arbitrary generator matrix, provided certain conditions are met. We then discuss how this challenges the security of the McEliece cryptosystem instantiated with this family of codes. The central object of our work is the quadratic hull related to a linear code, defined as the intersection of all quadrics passing through the columns of a given generator or parity-check matrix, where the columns are considered as points in the affine or projective space. The geometric properties of this object reveal important information about the internal algebraic structure of the code. This is particularly evident in the case of generalized Reed-Solomon codes, whose quadratic hull is deeply linked to a well-known algebraic variety called the rational normal curve. By utilizing the concept of Weil restriction of affine varieties, we demonstrate that the quadratic hull of a generic dual alternant code inherits many interesting features from the rational normal curve, on account of the fact that alternant codes are subfield-subcodes of generalized Reed-Solomon codes. If the rate of the generic alternant code is sufficiently high, this allows us to construct a polynomial-time algorithm for retrieving the underlying generalized Reed-Solomon code from which the alternant code is defined, which leads to an efficient key-recovery attack against the McEliece cryptosystem when instantiated with this class of codes. Finally, we discuss the generalization of this approach to Algebraic-Geometry codes and Goppa codes.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- The syzygy Distinguisher2025
- Polynomial Time Key-Recovery Attack on High Rate Random Alternant CodesIEEE Transactions on Information Theory, 2023
- The complexity of solving Weil restriction systemsJournal of Algebra, 2023
- On the dimension and structure of the square of the dual of a Goppa codeDesigns, Codes and Cryptography, 2022
- The quadratic hull of a code and the geometric view on multiplication algorithms2021
- Squares of Random Linear CodesIEEE Transactions on Information Theory, 2015
- On the unique representation of very strong algebraic geometry codesDesigns, Codes and Cryptography, 2012
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)IEEE Transactions on Information Theory, 1975