Implicit Factoring with Shared Middle Discrete Bits

Conference paper
First Online:
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 277)

Abstract

We study the problem of implicit factoring presented by May and Ritzenhofen in 2009 and apply it to more general settings, where prime factors of both integers are only known by implicit information of middle discrete bits. Consider two integers N 1 = p 1 q 1 and N 2 = p 2 q 2 where p 1, p 2, q 1, and q 2 are primes and q 1, q 2 ≈ N α . In the case of tlog2 N bits shared in one consecutive middle block, we describe a novel lattice-based method that leads to the factorization of two integers in polynomial time as soon as t > 4α. Moreover, we use much lower lattice dimensions and obtain a great speedup. Subsequently, we heuristically generalize the method to an arbitrary number n of shared blocks. The experimental results show that the constructed lattices work well in practical attacks.

This is a preview of subscription content, log in to check access.

References

  1. 1.
    May, A., & Ritzenhofen M. (2009). Implicit factoring: On polynomial time factoring given only an implicit hint. LNCS, 5443, 1–14.MathSciNetGoogle Scholar
  2. 2.
    Sarkar, S., & Maitra S. (2009). Further results on implicit factoring in polynomial time. Mathematics of Communications, 3(2), 205–217.CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Faugère J.-C., Marinier R., & Renault G. (2010). Implicit factoring with shared most significant and middle bits. LNCS, 6056, 70–87.Google Scholar
  4. 4.
    Herrman, M., & May, A. (2008). Solving linear equations modulo divisors: On factoring given any bits. LNCS, 5350, 406–424.Google Scholar
  5. 5.
    Jochemsz, E. (2007). Cryptanalysis of RSA variants using small roots of polynomials. Netherlands: Technische Universiteit Eindhoven.Google Scholar
  6. 6.
    Blömer, J., & May, A. (2003). New partial key exposure attacks on RSA. LNCS, 2729, 27–43.Google Scholar
  7. 7.
    Jochemsz, E., et al. (2006). A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. LNCS, 4284, 267–282.MathSciNetGoogle Scholar
  8. 8.
    Lenstra, A. K., Lenstra Jr. H. W., & Lovász L. (1982). Factoring polynomials with rational coefficients. Mathematiche Analen, 261(4), 515–534.Google Scholar
  9. 9.
    Howgrave-Graham, N. (1997). Finding small roots of univariate modular equations revisited. LNCS, 1355, 131–142.MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Applied MathematicsZhengzhou Information Science and Technology InstituteZhengzhouChina

Personalised recommendations