We give polynomial-time quantum algorithms for two problems from computational algebraic number theory. The first is Pell's equation. Given a positive non-square integer d, Pell's equation is x2 - dy2 = 1 and the goal is to find its integer solutions. Factoring integers reduces to finding integer solutions of Pell's equation, but a reduction in the other direction is not known and appears more difficult. The second problem is the principal ideal problem in real quadratic number fields. Solving this problem is at least as hard as solving Pell's equation, and is the basis of a cryptosystem which is broken by our algorithm.
|Original language||English (US)|
|Number of pages||6|
|Journal||Conference Proceedings of the Annual ACM Symposium on Theory of Computing|
|Publication status||Published - Sep 23 2002|
|Event||Proceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada|
Duration: May 19 2002 → May 21 2002
All Science Journal Classification (ASJC) codes