Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
We show how to find sufficiently small integer solutions to a polynomial in a single variable modulo N, and to a polynomial in two variables over the integers. The methods sometimes extend to more variables. As applications: RSA encryption with exponent 3 is vulnerable if the opponent knows two-thirds of the message, or if two messages agree over eight-ninths of their length; and we can find the factors of N = P Q if we are given the high order 5 log2 N bits of P. © 1997 International Association for Cryplologic Research.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences