Solving linear equations modulo divisors: On factoring given any bits

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

Volumn 5350 LNCS, Issue , 2008, Pages 406-424

  Herrmann, Mathias ^a   May, Alexander ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Factoring with known bits; Lattices; Small roots

Indexed keywords

APPLICATIONS; CRYPTOGRAPHY; FACTORIZATION; POLYNOMIAL APPROXIMATION;

ARBITRARY NUMBERS; COMPOSITE INTEGERS; FACTORING WITH KNOWN BITS; LATTICES; POLYNOMIAL TIMES; RUNNING TIMES; SMALL ROOTS;

HEURISTIC ALGORITHMS;

EID: 58349090134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89255-7_25     Document Type: Conference Paper

References (23)

1. 2 is NP-hard for Randomized Reductions (Extended Abstract). In: STOC, pp. 10-19 (1998)
2. 0.292. IEEE Transactions on Information Theory 46(4), 1339 (2000)
3. Bleichenbacher, D., May, A.: New Attacks on RSA with Small Secret CRT-Exponents. In: Public Key Cryptography, pp. 1-13 (2006)
4. Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved Low-Density Subset Sum Algorithms. Computational Complexity 2, 111-128 (1992)
5. Coron, J.-S., May, A.: Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring. J. Cryptology 20(1), 39-50 (2007)
6. Coppersmith, D.: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178-189. Springer, Heidelberg (1996)
7. Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155-165. Springer, Heidelberg (1996)
8. Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. J. Cryptology 10(4), 233-260 (1997)
9. Coron, J.-S.: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 379-394. Springer, Heidelberg (2007)
10. Girault, M., Misarsky, J.-F.: Selective Forgery of RSA Signatures Using Redundancy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 495-507. Springer, Heidelberg (1997)
11. Girault, M., Toffin, P., Vallée, B.: Computation of approximate L-th roots modulo n and application to cryptography. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 100-117. Springer, Heidelberg (1990)
12. Hastad, J.: Solving Simultaneous Modular Equations of Low Degree. SIAM Journal on Computing 17(2), 336-341 (1988)
13. Howgrave-Graham, N.: Finding Small Roots of Univariate Modular Equations Revisited. In: Proceedings of the 6th IMA International Conference on Cryptography and Coding, pp. 131-142 (1997)
14. Howgrave-Graham, N.: Approximate Integer Common Divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51-66. Springer, Heidelberg (2001)
15. Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring Polynomials with Ra tional Coefficients. Mathematische Annalen 261(4), 515-534 (1982)
16. Maurer, U.M.: On the Oracle Complexity of Factoring Integers. Computational Complexity 5(3/4), 237-247 (1995)
17. May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. PhD thesis, University of Paderborn (2003)
18. May, A.: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 213-219. Springer, Heidelberg (2004)
19. Minkowski, H.: Geometrie der Zahlen. Teubner (1910)
20. Nguyen, P.Q.: Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 555-570. Springer, Heidelberg (2004)
21. Nguyen, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146-180. Springer, Heidelberg (2001)
22. Nguyen, P.Q., Stehlé, D.: Floating-Point LLL Revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215-233. Springer, Heidelberg (2005)
23. Rivest, R.L., Shamir, A.: Efficient Factoring Based on Partial Information. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 31-34. Springer, Heidelberg (1986)