Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
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.
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics