Mathematics – Number Theory
Scientific paper
2010-08-06
Mathematics
Number Theory
29 pages
Scientific paper
We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and function fields. This gives us a unified view of several problems arising naturally in cryptography, coding theory, and the study of lattices. We give (1) a polynomial-time algorithm for finding small solutions of polynomial equations modulo ideals over algebraic number fields, (2) a faster variant of the Guruswami-Sudan algorithm for list decoding of Reed-Solomon codes, and (3) an algorithm for list decoding of algebraic-geometric codes that handles both single-point and multi-point codes. Coppersmith's algorithm uses lattice basis reduction to find a short vector in a carefully constructed lattice; powerful analogies from algebraic number theory allow us to identify the appropriate analogue of a lattice in each application and provide efficient algorithms to find a suitably short vector, thus allowing us to give completely parallel proofs of the above theorems.
Cohn Henry
Heninger Nadia
No associations
LandOfFree
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-593305