J. Faugère, R. Marinier, and G. Renault, Implicit factoring with shared most significant and middle bits, Public Key Cryptography, vol.6056, pp.70-87, 2010.

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 1975.

K. Kurosawa and T. Ueda, How to factor N1 and N2 when p1 = p2 (mod 2 t ), IWSEC 2013, vol.8231, pp.217-225, 2013.

A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.261, pp.513-534, 1982.

A. May, M. Ritzenhofen, and R. , Implicit factoring: On polynomial time factoring given only an implicit hint, Public Key Cryptography, vol.5443, pp.1-14, 2009.

R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, pp.120-126, 1978.

A. Shamir and . Paranoids, RSA Laboratories CryptoBytes, vol.1, pp.3-4, 1995.

S. Sarkar and S. Maitra, Further results on implicit factoring in polynomial time, Advances in Mathematics of Communications, vol.3, pp.205-217, 2009.