Implicit factoring with shared most significant and middle bits

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

Volumn 6056 LNCS, Issue , 2010, Pages 70-87

  Faugère, Jean Charles ^a   Marinier, Raphaël ^b   Renault, Guénaël ^c  

^a SORBONNE UNIVERSITÉ   (France)

^b INRIA   (France)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

implicit factorization; lattices; RSA

Indexed keywords

ALGEBRAIC RELATIONS; IMPLICIT FACTORIZATION; K FACTOR; LATTICE BASED METHOD; LATTICE DIMENSIONS; LATTICES; LEAST SIGNIFICANT BITS; MOST SIGNIFICANT BIT; POLYNOMIAL-TIME; RSA; RSA MODULI;

HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

FACTORIZATION;

EID: 79955537918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13013-7_5     Document Type: Conference Paper

References (17)

1. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symbolic Comput. 24(3-4), 235-265 (1997); Computational algebra and number theory, London (1993) (Pubitemid 127167874)
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) (Pubitemid 126071064)
3. Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31-51. Springer, Heidelberg (2008) (Pubitemid 351762822)
4. Hanrot, G., Stehlé, D.: Improved analysis of Kannan's shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 170-186. Springer, Heidelberg (2007)
5. Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking rsa variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 267-282. Springer, Heidelberg (2006)
6. Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: STOC, pp. 193-206. ACM, New York (1983) (Pubitemid 14522551)
7. Lehmer, D.H., Powers, R.E.: On factoring large numbers. Bulletin of the AMS 37, 770-776 (1931)
8. Lenstra, A.K., Lenstra Jr., H.W.: The development of the number field sieve. Lecture Notes in Mathematics, vol. 1554. Springer, Berlin (1993)
9. May, A., Ritzenhofen,M.: Implicit factoring: On polynomial time factoring given only an implicit hint. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 1-14. Springer, Heidelberg (2009)
10. Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: a cryptographic perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston (2002)
11. Morrison, M.A., Brillhart, J.: A method of factoring and the factorization of F7.Mathematics of Computation 29(129), 183-205 (1975)
12. Nguyen, P.Q., Stehlé, D.: Floating-point lll revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215-233. Springer, Heidelberg (2005) (Pubitemid 41313955)
13. Pujol, X., Stehlé, D.: Rigorous and efficient short lattice vectors enumeration. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 390-405. Springer, Heidelberg (2008)
14. 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)
15. Sarkar, S., Maitra, S.: Further Results on Implicit Factoring in Polynomial Time. Advances in Mathematics of Communications 3(2), 205-217 (2009)
16. Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: FOCS, pp. 124-134. IEEE, Los Alamitos (1994)
17. Vanstone, S.A., Zuccherato, R.J.: Short rsa keys and their generation. J. Cryptology 8(2), 101-114 (1995)