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.

• Type: Journal
• Year: 2007
• Where: MST
• Authors: Igor Shparlinski, Ron Steinfeld
• Keywords: Integer, Lattice Reduction, MST 2007, Polynomial Time Algorithm