Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
KM Klein, J Reuter - arXiv preprint arXiv:2408.06685, 2024 - arxiv.org
The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral
numbers $ a_1 $ and $ a_2 $, it computes the greatest common divisor (gcd) of $ a_1 $ and …
numbers $ a_1 $ and $ a_2 $, it computes the greatest common divisor (gcd) of $ a_1 $ and …
Embedding Integer Lattices as Ideals into Polynomial Rings
Y Cheng, Y Feng, Y Pan - … of the 2024 International Symposium on …, 2024 - dl.acm.org
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the
additional algebraic structure of ideal lattices usually makes us worry about the security, and …
additional algebraic structure of ideal lattices usually makes us worry about the security, and …