Dan Boneh
- 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.]] Google Scholar
Digital Library
- 2.D. Bleichenbacher, P. Nguyen, "Noisy Polynomial Interpolation and Noisy Chinese Remaindering", to appear in Eurocrypt '2000.]]Google Scholar
- 3.D. Boneh, G. Durfee, "Cryptanalysis of RSA with private key d ~ N~'~'92'', Proc. of Eurocrypt '98, pp. 1-11, 1998.]]Google Scholar
- 4.D. Boneh, G. Durfee, N. Howgrave-Graham, "Factoring N --- prq for large r", Proc. of Crypto '99, pp. 326-337, 1999.]] Google ScholarDigital Library
- 5.D. Coppersmith, "Small solutions to polynomial equations, and low exponent RSA vulnerabilities", J. of Cryptology, Vol. 10, pp. 233-260, 1997.]]Google ScholarDigital Library
- 6.O. Goldreich, D. Ron, M. Sudan, "Chinese remaindering with errors", Proc. of STOC '99, pp. 225- 234, 1999.]] Google ScholarDigital Library
- 7.O. Goldreich, R. Rubinfeld, M. Sudan, "Learning polynomials with queries: the highly noisy case", in proc. FOCS 95, pp. 294-303, 1995.]] Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 10.R. Kotter, "A unified description of an error locating procedure for linear codes", in proc. of Algebraic and Combinatorial Coding Theory, 1992.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 12.A. Lenstra, H.W. Lenstra Jr., "The development of the number field sieve", Lecture Notes in Mathematics, Vol. 1554, Springer-Verlag, 1994.]]Google Scholar
- 13.A. Lenstra, H.W. Lenstra Jr., and L. Lovasz, "Factoring polynomial with rational coefficients", Mathematiche Annalen, 261:515-534, 1982.]]Google Scholar
- 14.L. Lovasz, "An algorithmic theory of numbers, graphs and convexity", SIAM lecture series, Vol. 50, 1986.]]Google Scholar
- 15.D. Mandelbaum, "On a class of arithmetic codes and a decoding algorithm", IEEE Tran. on Info. theory, vol. 22, No. 1, pp. 85-88, 1976.]]Google ScholarDigital Library
- 16.D. Mandelbaum, "Further results on decoding arithmetic residue codes", IEEE Tran. on Info. theory, vol. 24, No. 5, pp. 643-644, 1978.]]Google ScholarDigital Library
- 17.M. Naor, B. Pinkas, "Oblivious Transfer and Polynomial Evaluation", in proc. STOC 1999, pp. 245- 254, 1999.]] Google ScholarDigital Library
- 18.M. Soderstrand, W. Jenkins, G. Jullien, F. Taylor, "Residue number system arithmetic: modern applications in digital signal processing", IEEE Press, 1986.]] Google ScholarDigital Library
- 19.M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound", J. of complexity, vol. 13, no. 1, pp. 180-193, 1997.]] Google ScholarDigital Library
Index Terms
- Finding smooth integers in short intervals using CRT decoding
Recommendations
Finding smooth integers in short intervals using CRT decoding
Special issue on STOC 2000We present a new algorithm for CRT list decoding. An instance of the, CRT list decoding problem consists of integers B, 〈p1, ..., pn〉 and 〈r1, ..., rn〉, where p1 < p2 < ... < pn is a sequence of relatively prime integers. The CRT list decoding problem ...
Short communication: A comment on modified big-M method to recognize the infeasibility of linear programming models
Recently Soleimani-Damaneh (modified big-M method to recognize the infeasibility of linear programming models, Knowledge-Based Systems 21 (2008) 377-382), proposed a modified big-M method for detecting the infeasibility of a linear programming problem. ...
Short Note: Tunneling oxide engineering by ion implantation of nitrogen for 3D vertical silicon pillar SONOS flash memory
The electrical characteristics of silicon-oxide-nitride-oxide-silicon (SONOS) flash memory with a 3D vertical silicon pillar structure were studied. As an alternative method for the formation of the tunneling oxide, nitrogen ion implantation was applied ...
Comments