On finding small solutions of modular multivariate polynomial equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1403, Issue , 1998, Pages 158-170

  Jutla, Charanjit S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; MULTIVARIABLE SYSTEMS; POLYNOMIAL APPROXIMATION;

LINEARLY INDEPENDENTS; MULTIVARIATE POLYNOMIAL; POLYNOMIAL EQUATION; POLYNOMIAL-TIME; RANDOM BITS; TIME POLYNOMIALS;

POLYNOMIALS;

EID: 84957627960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054124     Document Type: Conference Paper

References (12)

1. Daniel Bleichenbacher, On the Security of the KMOV Public Key Cryptosystem, in Proc. Crypto 97, LNCS 1294, pp 235-248.
2. Don Coppersmith, Finding a Small Root of a Univariate Modular Equation, in Eurocrypt 96, LNCS 1070, pp 155-165.
3. D. Coppersmith, M. Franklin, J. Patarin and M. Reiter, Low exponent RSA with related messages, Proc. Eurocrypt 96.
4. M. Franklin, and M. Reiter, A linear protocol failure for RSA with exponent three, presented at CRYPT095 rump session.
5. N. Howgrave-Graham, Finding small roots of univariate modular equations revisited, Cryptography and Coding, LNCS 1355, M. Darnell, Ed. Springer-Verlag, 1997, pages 131-142
6. n. In Advances in Cryptology - CRYPTO 91, LNCS vol. 576, pp 252-266.
7. D.E. Knuth, The art of computer programming, Vol 1, Fundamental algorithms, Addison Wesley 1973
8. D.E. Knuth, The art of computer programming, Vol 2, Seminumerical algorithms, Addison Wesley 1981
9. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, 48(177):203-209,1987.
10. LiDIA, A C++ Library For Computational Number Theory, http://www.informatik.th-darmstadt.de/TI/LiDIA/
11. A.K. Lenstra, H.W. Lenstra, and L. Lovász, Factoring Polynomials with Rational Coefficients, in Mathematische Annalen, Vol. 261, pp 515-534, 1982
12. R.L. Rivest, A. Shamir and L. Adleman, A method of obtaining digital signatures and public-key cryptosystems, CACM, Vol 21, no. 2, Feb 1978.