Finding smooth integers in short intervals using CRT decoding

Journal of Computer and System Sciences

Volumn 64, Issue 4, 2002, Pages 768-784

  Boneh, Dan ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; INTERPOLATION; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

CRT DECODING; QUADRATIC SIEVE; REED-SOLOMON CODES; SMOOTH INTEGERS;

ALGORITHMS;

EID: 1942544290     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1827     Document Type: Conference Paper

References (22)

1. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, Reconstructing algebraic functions from mixed data, SIAM J. Comput. 28 (1999), 488-511.
2. E. Berlekamp, "Algebraic Coding Theory," McGraw-Hill, New York, 1968.
3. I. Blake, G. Seroussi, and N. Smart, "Elliptic Curves in Cryptography," Cambridge Univ. Press, Cambridge, UK, 1999.
4. D. Bleichenbacher and P. Nguyen, Noisy polynomial interpolation and noisy Chinese remaindering, in "Proc. of Eurocrypt 2000."
5. D. Boneh, Finding smooth integers using CRT decoding, in "Proc. of STOC 2000," pp. 265-272, 2000.
6. 292, in "Proc. of Eurocrypt '98," pp. 1-11, 1998.
7. D. Boneh, G. Durfee, and N. Howgrave-Graham, Factoring N = p'q for large r, in "Proc. of Crypto '99," pp. 326-337, 1999.
8. H. Cohen, "A Course in Computational Algebraic Number Theory," Springer-Verlag, Berlin, 1993.
9. D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities, J. Cryptology 10 (1997), 233-260.
10. O. Goldreich, D. Ron, and M. Sudan, Chinese remaindering with errors, in "Proc. of STOC "99," pp. 225-234, 1999. Updated version available from ECCC.
11. O. Goldreich, R. Rubinfeld, and M. Sudan, Learning polynomials with queries: The highly noisy case, in "Proc. FOCS '95," pp. 294-303, 1995.
12. V. Guruswami and M. Sudan, Improved decoding for Reed-Solomon and algebraic geometric codes, IEEE Trans. Info. Theory 45 (1999), 1757-1767.
13. V. Guruswami, A. Sahai, and M. Sudan, Soft decision decoding of Chinese remainder codes, in "Proc. FOCS 2000," 2000.
14. N. Howgrave-Graham, Finding small roots of univariate modular equations revisited, in "Proc. of Cryptography and Coding," LNCS 1355, pp. 131-142, Springer-Verlag, Berlin, 1997.
15. A. Lenstra and H. W. Lenstra, Jr., Algorithms in number theory, in "Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity," Chap. 12, pp. 673-715, 1990.
16. A. Lenstra and H. W. Lenstra, Jr., "The Development of the Number Field Sieve," Lecture Notes in Mathematics, Vol. 1554, Springer-Verlag, Berlin, 1994.
17. A. Lenstra, H. W. Lenstra, Jr., and L. Lovasz, Factoring polynomial with rational coefficients, Math. Ann. 261 (1982), 515-534.
18. L. Lovasz, "An Algorithmic Theory of Numbers, Graphs and Convexity," SIAM Lecture Series, Vol. 50, SIAM, Philadelphia, 1986.
19. F. MacWilliams and N. Slaon, "The Theory of Error Correcting Codes," North-Holland, Amsterdam, 1981.
20. M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation, in "Proc. STOC 1999," pp. 245-254, 1999.
21. M. Soderstrand, W. Jenkins, G. Jullien, and F. Taylor, "Residue Number System Arithmetic: Modern Applications in Digital Signal Processing," IEEE Press, New York, 1986.
22. M. Sudan, Decoding of Reed-Solomon Codes beyond the error-correction bound, J. Complexity 13 (1997), 180-193.