Toward a rigorous variation of coppersmith's algorithm on three variables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4515 LNCS, Issue , 2007, Pages 361-378

  Bauer, Aurélie ^b   Joux, Antoine ^a,b  

^a Delegation Generale pour l'Armement   (France)

^b UNIVERSITY OF VERSAILLES   (France)

Author keywords

Coppersmith's algorithms; Gr bner basis; Lattice reduction

Indexed keywords

COMPUTATIONAL EFFICIENCY; CRYPTOGRAPHY; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COPPERSMITH ALGORITHMS; GROBNER BASIS; LATTICE REDUCTION;

ALGORITHMS;

EID: 38049098109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_21     Document Type: Conference Paper

References (15)

1. M. Bardet. Etude de sytèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. PhD thesis, University of Paris 6, 2004.
2. J. Blömer and A. May. Low Secret Exponent RSA Revisited. In CaLC '01: Revised Papers from the International Conference on Cryptography and Lattices, pages 4-19, London, UK, 2001. Springer-Verlag.
3. J. Blömer and A. May. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. Proceedings of Eurocrypt 2005, Lecture Notes in Computer Science, 3494:251-257, 2005.
4. 0.292 IEEE Transactions on Information Theory, 46:1339-1349, July 2000.
5. D. Coppersmith. Finding a Small Root of a Bivariate Integer Equation; Factoring with high bits known. In Advances in Cryptology-Eurocrypt '96, Lecture Notes in Computer Science, volume 1070, pages 178-189. Springer-Verlag, 1996.
6. D. Coppersmith. Finding a Small Root of a Univariate Modular Equation. In Advances in Cryptology-Eurocrypt '96, Lecture Notes in Computer Science, volume 1070, pages 155-165. Springer Verlag, 1996.
7. D. Coppersmith. Finding Small Solutions to Small Degree Polynomials. In Cryptography and Lattice Conference, Lecture Notes in Computer Science, volume 2146. Springer-Verlag, 2001.
8. J.-S. Coron. Finding Small Roots of Bivariate Integer Polynomial Equations Revisited. In Advances in Cryptology-Eurocrypt '04, Lecture Notes in Computer Science, pages 492-505. Springer-Verlag, 2004.
9. M. Ernst, E. Jochemsz, A. May, and B.de Weger. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In Advances in Cryptology (Eurocrypt 2005), Lecture Notes in Computer Science Volume 3494, pages 371-386, Springer-Verlag, 2005.
10. J.-C. Faugère. A New Efficient Algorithm for Computing Gröbner Bases (F4). Journal of Pure and Applied Algebra, (139):61-88, 1999.
11. M. J. Hinek. New partial key exposure attacks on RSA revisited. Technical report, CACR, Centre for Applied Cryptographic Research, University of Waterloo, 2004.
12. M. J. Hinek. Small Private Exponent Partial Key-Exposure Attacks on Multiprime RSA. Technical report, CACR, Centre for Applied Cryptographic Research, University of Waterloo, 2005.
13. N. Howgrave-Graham. Finding Small Roots of Univariate Modular Equations Revisited. In Proceedings of the 6th IMA International Conference on Cryptography and Coding, pages 131-142, London, UK, 1997. Springer-Verlag.
14. N. Howgrave-Graham. Approximate Integer Common Divisor. In CaLC '01: Lecture Notes in Computer Science, volume 2146, pages 51-66. Springer-Verlag, 2001.
15. A.K. Lenstra, Jr. H.W. Lenstra, and L. Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:513-534, 1982.