Finding Small Solutions to Small Degree Polynomials
暂无分享,去创建一个
[1] Don Coppersmith,et al. Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known , 1996, EUROCRYPT.
[2] S. Konyagin,et al. On polynomial congruences , 1994 .
[3] Kaisa Nyberg,et al. Advances in Cryptology — EUROCRYPT'98 , 1998 .
[4] Don Coppersmith,et al. Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities , 1997, Journal of Cryptology.
[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[6] Ueli Maurer,et al. Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.
[7] Nick Howgrave-Graham,et al. Approximate Integer Common Divisors , 2001, CaLC.
[8] Leonard M. Adleman,et al. NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..
[9] T. J. Rivlin. The Chebyshev polynomials , 1974 .
[10] Nick Howgrave-Graham,et al. Finding Small Roots of Univariate Modular Equations Revisited , 1997, IMACC.
[11] Charanjit S. Jutla,et al. On Finding Small Solutions of Modular Multivariate Polynomial Equations , 1998, EUROCRYPT.
[12] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[13] Richard Askey. CHEBYSHEV POLYNOMIALS From Approximation Theory to Algebra and Number Theory , 1991 .
[14] Johan Håstad,et al. On Using RSA with Low Exponent in a Public Key Network , 1985, CRYPTO.
[15] Noam D. Elkies. Rational Points Near Curves and Small Nonzero |x3-y2| via Lattice Reduction , 2000, ANTS.
[16] Colin Boyd,et al. Cryptography and Coding , 1995, Lecture Notes in Computer Science.
[17] T. J. Rivlin. Chebyshev polynomials : from approximation theory to algebra and number theory , 1990 .
[18] Faculteit der Wiskunde en Natuurwetenschappen,et al. Divisors in residue classes , 1983 .
[19] Don Coppersmith,et al. Finding a Small Root of a Univariate Modular Equation , 1996, EUROCRYPT.