Chinese remaindering with multiplicative noise

Igor E. Shparlinski; Ron Steinfeld

doi:10.1007/s00224-005-1272-9

Chinese remaindering with multiplicative noise

Igor E. Shparlinski^*, Ron Steinfeld

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	33-41
Number of pages	9
Journal	Theory of Computing Systems
Volume	40
Issue number	1
DOIs	https://doi.org/10.1007/s00224-005-1272-9
Publication status	Published - Feb 2007

Access to Document

10.1007/s00224-005-1272-9

Cite this

@article{710c6a4616424ec38075983d434237e0,

title = "Chinese remaindering with multiplicative noise",

abstract = "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.",

author = "Shparlinski, {Igor E.} and Ron Steinfeld",

year = "2007",

month = feb,

doi = "10.1007/s00224-005-1272-9",

language = "English",

volume = "40",

pages = "33--41",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer, Springer Nature",

number = "1",

}

TY - JOUR

T1 - Chinese remaindering with multiplicative noise

AU - Shparlinski, Igor E.

AU - Steinfeld, Ron

PY - 2007/2

Y1 - 2007/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33846864704&partnerID=8YFLogxK

U2 - 10.1007/s00224-005-1272-9

DO - 10.1007/s00224-005-1272-9

M3 - Article

AN - SCOPUS:33846864704

SN - 1432-4350

VL - 40

SP - 33

EP - 41

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 1

ER -

Chinese remaindering with multiplicative noise

Abstract

Access to Document

Other files and links

Fingerprint

Cite this