Smallest Reduction Matrix of Binary Quadratic Forms - GREYC amacc Access content directly
Conference Papers Year : 2010

Smallest Reduction Matrix of Binary Quadratic Forms

Aurore Bernard
  • Function : Author
DMI
Nicolas Gama
  • Function : Author
  • PersonId : 941659

Abstract

We present a variant of the Lagrange-Gauss reduction of quadratic forms designed to minimize the norm of the reduction matrix within a quadratic complexity. The matrix computed by our algorithm on the input f has norm O(∥f∥1/2/Δ1/4f) , which is the square root of the best previously known bounds using classical algorithms. This new bound allows us to fully prove the heuristic lattice based attack against NICE Cryptosystems, which consists in factoring a particular subclass of integers of the form pq 2. In the process, we set up a homogeneous variant of Boneh-Durfee-HowgraveGraham’s algorithm which finds small rational roots of a polynomial modulo unknown divisors. Such algorithm can also be used to speed-up factorization of pq r for large r.

Dates and versions

hal-01083360 , version 1 (17-11-2014)

Identifiers

Cite

Aurore Bernard, Nicolas Gama. Smallest Reduction Matrix of Binary Quadratic Forms. 9th International Symposium, ANTS-IX, Jul 2010, Nancy, France. pp.32-49, ⟨10.1007/978-3-642-14518-6_7⟩. ⟨hal-01083360⟩
80 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More