Chinese Remaindering with Multiplicative Noise

Theory of Computing Systems - Tập 40 - Trang 33-41 - 2005
Igor E. Shparlinski1, Ron Steinfeld1
1Department of Computing, Macquarie University, Sydney, NSW 2109, Australia

Tóm tắt

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.

Thông tin
Thông tin xuất bản

Theory of Computing Systems

Tập 40

33-41

Thông tin tác giả