Smallest Reduction Matrix of Binary Quadratic Forms

DOI10.1007/978-3-642-14518-6_7zbMath1230.11151OpenAlexW2138438097MaRDI QIDQ4931639

Aurore Bernard, Nicolas Gama

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14518-6_7

zbMATH Keywords

factorizationhomogeneous variant of Boneh-Durfee-Howgrave-Graham's algorithmminimizing the norm of the reduction matrix within quadratic complexityproving the heuristic lattice based attack against NICE Cryptosystemsvariant of the Lagrange-Gauss reduction of quadratic forms

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Minima of forms (11H50) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary quadratic forms. An algorithmic approach
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• On some problems of the arithmetical theory of continued fractions
• An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
• Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
• Some results concerning certain periodic continued fractions
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Algorithmic Number Theory

This page was built for publication: Smallest Reduction Matrix of Binary Quadratic Forms