Skip to main content
SpringerLink
Log in

Chinese Remaindering with Multiplicative Noise

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computing, Macquarie University, Sydney, NSW 2109, Australia

    Igor E. Shparlinski & Ron Steinfeld

Authors
  1. Igor E. Shparlinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ron Steinfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Igor E. Shparlinski or Ron Steinfeld.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shparlinski, I., Steinfeld, R. Chinese Remaindering with Multiplicative Noise. Theory Comput Syst 40, 33–41 (2007). https://doi.org/10.1007/s00224-005-1272-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1272-9

Keywords

Search

Navigation