Finding smooth integers in short intervals using CRT decoding

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 265-272

  Boneh, Dan ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CRT DECODING; LIST DECODING; NEW APPLICATIONS; POSITIVE INTEGERS; QUADRATIC SIEVE; REED SOLOMON; SHORT-INTERVAL; SMOOTH INTEGERS;

ALGORITHMS; COMPUTATION THEORY; REED-SOLOMON CODES; APPROXIMATION THEORY; DATA STRUCTURES; DECODING; INTEGER PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

DECODING; ALGORITHMS;

CHINESE THEOREM PROVING (CRT); REED-SOLOMON CODES;

EID: 0033706605     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335337     Document Type: Conference Paper

References (19)

1. S. Ar, R. Lipton, R. Rubinfeld, M. Sudan, " Reconstructing algebraic functions from mixed data", SIAM J. of Computing, vol. 28, No. 2, pp. 488-511, 1999.
2. D. Bleichenbacher, P. Nguyen, "Noisy Polynomial Interpolation and Noisy Chinese Remaindering ", to appear in Eurocrypt '2000.
3. 0.292", Proc. of Eurocrypt '98, pp. 1-11, 1998.
4. rq for large r", Proc. of Crypto '99, pp. 326-337, 1999.
5. D. Coppersmith, "Small solutions to polynomial equations, and low exponent RSA vulnerabilities", J. of Cryptology, Vol. 10, pp. 233-260, 1997. (Pubitemid 127754574)
6. O. Goldreich, D. Ron, M. Sudan, "Chinese remaindering with errors ", Proc. of STOC '99, pp. 225-234, 1999.
7. O. Goldreich, R. Rubinfeld, M. Sudan, "Learning polynomials with queries: the highly noisy case", in proc. FOCS 95, pp. 294-303, 1995.
8. V. Guruswami, M. Sudan, "Improved decoding for Reed-Solomon and algebraic geometric codes", IEEE Tran. on Info. Theory, vol. 45, no. 6, pp 1757-1767, 1999. (Pubitemid 32871911)
9. N. Howgrave-Graham, "Finding small roots of univariate modular equations revisited", Proc. of Cryptography and Coding, LNCS 1355, Springer-Verlag, 1997, pp. 131-142.
10. R. Kotter, "A unified description of an error locating procedure for linear codes ", in proc. of Algebraic and Combinatorial Coding Theory, 1992.
11. A. Lenstra, H.W. Lenstra Jr., " Algorithms in Number Theory", in Handbook of Theoretical Computer Science (Volume A: Algorithms and Complexity), ch. 12, pp. 673-715, 1990.
12. A. Lenstra, H.W. Lenstra Jr., "The development of the number field sieve ", Lecture Notes in Mathematics, Vol. 1554, Springer-Verlag, 1994.
13. A. Lenstra, H.W. Lenstra Jr., and L. Lovasz, " Factoring polynomial with rational coefficients", Mathematiche Annalen, 261: 515-534, 1982.
14. L. Lovasz, "An algorithmic theory of numbers, graphs and convexity ", SIAM lecture series, Vol. 50, 1986.
15. D. Mandelbaum, "On a class of arithmetic codes and a decoding algorithm ", IEEE Tram on Info. theory, vol. 22, No. 1, pp. 85-88, 1976.
16. D. Mandelbaum, "Further results on decoding arithmetic residue codes ", IEEE Tran. on Info. theory, vol. 24, No. 5, pp. 643-644, 1978.
17. M. Naor, B. Pinkas, "Oblivious Transfer and Polynomial Evaluation ", in proc. STOC 1999, pp. 245-254, 1999.
18. M. Soderstrand, W. Jenkins, G. Jullien, F. Taylor, " Residue number system arithmetic: modern applications in digital signal processing ", IEEE Press, 1986.
19. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound", J. of complexity, vol. 13, no. 1, pp. 180-193, 1997. (Pubitemid 127172728)