Noisy Chinese remaindering in the Lee norm

[1]  Igor E. Shparlinski,et al.  The Insecurity of the Digital Signature Algorithm with Partially Known Nonces , 2002, Journal of Cryptology.

[2]  Shojiro Sakata.  On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes , 2001, AAECC.

[3]  Madhu Sudan,et al.  Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms , 2001, AAECC.

[4]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[5]  Phong Q. Nguyen.  The Two Faces of Lattices in Cryptology , 2001, Selected Areas in Cryptography.

[6]  Aggelos Kiayias,et al.  Secure Games with Polynomial Expressions , 2001, ICALP.

[7]  Ravi Kumar,et al.  A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.

[8]  Igor E. Shparlinski,et al.  Sparse polynomial approximation in finite fields , 2001, STOC '01.

[9]  T. Scharping.  Hide-and-seek: China's elusive population data , 2001 .

[10]  Venkatesan Guruswami,et al.  "Soft-decision" decoding of Chinese remainder codes , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Jacques Stern,et al.  Lattice Reduction in Cryptology: An Update , 2000, ANTS.

[12]  R. R. Nielsen.  A class of Sudan-decodable codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[13]  Frédéric Magniez,et al.  Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey , 2000, Theoretical Aspects of Computer Science.

[14]  Dan Boneh,et al.  Finding smooth integers in short intervals using CRT decoding , 2000, STOC '00.

[15]  Tom Høholdt,et al.  Decoding Hermitian Codes with Sudan's Algorithm , 1999, AAECC.

[16]  Dana Ron,et al.  Chinese remaindering with errors , 1999, STOC '99.

[17]  H. Wasserman,et al.  List Decoding of Algebraic-Geometric Codes , 1999, IEEE Trans. Inf. Theory.

[18]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[19]  Antoine Joux,et al.  Lattice Reduction: A Toolbox for the Cryptanalyst , 1998, Journal of Cryptology.

[20]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[21]  Dan Boneh,et al.  Rounding in lattices and its cryptographic applications , 1997, SODA '97.

[22]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[23]  Dan Boneh,et al.  Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes , 1996, CRYPTO.

[24]  C. Ding.  Chinese remainder theorem , 1996 .

[25]  Ronitt Rubinfeld,et al.  Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[26]  Ronitt Rubinfeld,et al.  Reconstructing algebraic functions from mixed data , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[27]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[28]  C. P. Schnorr,et al.  A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..

[29]  R. Kannan.  ALGORITHMIC GEOMETRY OF NUMBERS , 1987 .

[30]  P. Erdös,et al.  Products of integers in short intervals , 1984 .

[31]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[32]  T. N. Shorey,et al.  On Grimm's problem relating to factorisation of a block of consecutive integers. II. , 1976 .

[33]  On Grimm's problem relating to factorisation of a block of consecutive integers. , 1975 .

[34]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .