Algebraic attack on NTRU using Witt vectors and Gröbner bases

@inproceedings{Bourgeois2009AlgebraicAO,
  title={Algebraic attack on NTRU using Witt vectors and Gr{\"o}bner bases},
  author={G. Bourgeois and J. Faug{\`e}re},
  booktitle={J. Math. Cryptol.},
  year={2009}
}
Abstract We present an algebraic attack on NTRU (restricted to the case where the parameter q is a power of two) using the method of the Witt vectors proposed by Silverman, Smart and Vercauteren [Springer: 278–298, 2005]; the latter considered only the first two bits of a Witt vector attached to the recovering of the secret key in order to reduce the problem to the resolution of an algebraic system over 𝔽2. The theoretical complexity of this resolution was not studied by the authors. In this… Expand
3 Citations

References

SHOWING 1-10 OF 24 REFERENCES
An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations
  • 8
  • Highly Influential
  • PDF
Comparison Between XL and Gröbner Basis Algorithms
  • 143
  • PDF
A new efficient algorithm for computing Gröbner bases (F4)
  • 1,122
  • PDF
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
  • 413
  • PDF
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
  • 841
  • Highly Influential
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
  • 557
On the Witt vector
  • 1
  • PDF
NTRU: A Ring-Based Public Key Cryptosystem
  • 1,369
  • PDF
...
1
2
3
...