论文信息 - Chinese Remaindering with Multiplicative Noise

Chinese Remaindering with Multiplicative Noise

We use lattice reduction to obtain a polynomial-time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when the multipliers are unknown but small.

Igor E. Shparlinski | Ron Steinfeld | Ron Steinfeld | I. Shparlinski

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

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

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

[4] Ron Steinfeld,et al. Lattice-based threshold-changeability for standard CRT secret-sharing schemes , 2006, Finite Fields Their Appl..

[5] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[6] Jacques Stern,et al. The Two Faces of Lattices in Cryptology , 2001, CaLC.

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

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

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

[10] Igor E. Shparlinski,et al. Noisy Chinese remaindering in the Lee norm , 2004, J. Complex..

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

[12] Igor E. Shparlinski,et al. Polynomial interpolation from multiples , 2004, SODA '04.

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

[14] Dana Ron,et al. Chinese remaindering with errors , 2000, IEEE Trans. Inf. Theory.