Chinese remaindering with multiplicative noise

Igor E. Shparlinski*, Ron Steinfeld

*Corresponding author for this work

Research output: Contribution to journalArticle


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.

Original languageEnglish
Pages (from-to)33-41
Number of pages9
JournalTheory of Computing Systems
Issue number1
Publication statusPublished - Feb 2007

Fingerprint Dive into the research topics of 'Chinese remaindering with multiplicative noise'. Together they form a unique fingerprint.

Cite this