Implicit factoring: On polynomial time factoring given only an implicit hint

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

Volumn 5443, Issue , 2009, Pages 1-14

  May, A ^a   Ritzenhofen, Maike ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Factoring with an oracle; Lattices

Indexed keywords

CHROMIUM COMPOUNDS; CRYSTAL LATTICES; POLYNOMIAL APPROXIMATION;

FACTORING WITH AN ORACLE; IMPLICIT INFORMATIONS; LEAST SIGNIFICANT BITS; POLYNOMIAL-TIME; RSA MODULI;

PUBLIC KEY CRYPTOGRAPHY;

EID: 67049119182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00468-1_1     Document Type: Conference Paper

References (22)

1. Blomer, J.: Closest vectors, successive minima, and dual HKZ-bases of lattices. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 248-259. Springer, Heidelberg (2000)
2. 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)
3. Coppersmith, D.: Small solutions to polynomial equations and low exponent vulnerabilities. Journal of Cryptology 10(4), 223-260 (1997)
4. Coppersmith, D.: Finding small solutions to small degree polynomials. In: Silver-man, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 20-31. Springer, Heidelberg (2001)
5. Crepeau, C., Slakmon, A.: Simple backdoors for RSA key generation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 403-416. Springer, Heidelberg (2003)
6. Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A cryptographic perspective. Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston (2002)
7. Helfrich, B.: Algorithms to Construct Minkowski Reduced and Hermite Reduced Lattice Basis. Theoretical Computer Science 41, 125-139 (1985)
8. Kannan, R.: Minkowski's Convex Body Theorem and Integer Programming. Mathematics of Operations Research 12(3), 415-440 (1987)
9. Lenstra Jr., H.W.: Factoring Integers with Elliptic Curves. Ann. Math. 126, 649673 (1987)
10. Lenstra, A.K., Lenstra Jr., H.W.: The Development of the Number Field Sieve. Springer, Heidelberg (1993)
11. Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 513-534 (1982)
12. Maurer, U.M.: Factoring with an oracle. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 429-436. Springer, Heidelberg (1993)
13. Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. Cambridge University Press, Cambridge (2000)
14. Minkowski, H.: Geometrie der Zahlen. Teubner-Verlag (1896)
15. Nguyen, P.Q., Stehle, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EU-ROCRYPT 2005. LNCS, vol. 3494, pp. 215-233. Springer, Heidelberg (2005)
16. Pomerance, C.: The quadratic sieve factoring algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 169-182. Springer, Heidelberg (1985)
17. Rivest, R.L., Shamir, A.: Efficient factoring based on partial information. In: Pich-ler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 31-34. Springer, Heidelberg (1986)
18. Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120-126 (1978)
19. Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, pp. 124-134. IEEE Computer Science Press, Los Alamitos (1994)
20. Steinfeld, R., Zheng, Y.: An advantage of low-exponent RSA with modulus primes sharing least significant bits. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 52-62. Springer, Heidelberg (2001)
21. Vanstone, S.A., Zuccherato, R.J.: Short RSA Keys and Their Generation. Journal of Cryptology 8(2), 101-114 (1995)
22. Young, A., Yung, M.: The prevalence of kleptographic attacks on discrete-log based cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 264276. Springer, Heidelberg (1997)