Chinese Remaindering with Multiplicative Noise

13 years 3 months ago

Download web.science.mq.edu.au

We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo suﬃciently many primes, when the multipliers are unknown but small.

Igor Shparlinski, Ron Steinfeld

Real-time Traffic

Integer | Lattice Reduction | MST 2007 | Polynomial Time Algorithm |

claim paper

» Chinese remainder theorem based group key management

» The Chinese Remainder Theorem and its Application in a HighSpeed RSA Crypto Chip

» Efficient Multiplication of Polynomials on Graphics Hardware

» Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes

» Build Chinese Emotion Lexicons Using A Graphbased Algorithm and Multiple Resources

» Algorithms for solving linear systems over cyclotomic fields

» Secure multimedia content delivery with multiparty multilevel DRM architecture

» Fast implementations of RSA cryptography

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MST
Authors	Igor Shparlinski, Ron Steinfeld

Comments (0)

Sciweavers

Chinese Remaindering with Multiplicative Noise

Integer | Lattice Reduction | MST 2007 | Polynomial Time Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers