Abstract

The geometric embedding of an ideal in the algebraic integer ring of some number field is called an ideal lattice. Ideal lattices and the shortest vector problem (SVP) are at the core of many recent developments in lattice-based cryptography. We utilize the matrix of the linear transformation that relates two commonly used geometric embeddings to provide novel results concerning the equivalence of the SVP in these ideal lattices arising from rings of cyclotomic integers.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call