Polynomial Time Reduction from Approximate Shortest Vector Problem to Principal Ideal Problem for Lattices in Some Cyclotomic Rings
Hao Chen · 2015
Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lat-tices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is the principal ideal problem (PIP). Its goal is to find a generator of any principal ideal in the ring of alge-braic integers in any number field. In this paper we give a polynomial time reduction from approximate shortest lattice vector problem for principal ideal lattices to their PIP’s in cyclotomic integer rings of ex-tension degrees φ(n) = 2k−1, k = 2, 3,.... Thus if a polynomial time quantum algorithm for PIP of arbitrary number fields could be pro-posed, this would implies that approximate SVP problem for principal ideal lattices within a polynomial factor in this kind cyclotomic integer rings can be solved by a polynomial time quantum algorithm. 1