Testing Isomorphism of Lattices over CM-Orders
From MaRDI portal
Publication:5232327
DOI10.1137/17M115390XzbMath1473.11228arXiv1706.07373OpenAlexW2963423263WikidataQ102396758 ScholiaQ102396758MaRDI QIDQ5232327
Hendrik W. jun. Lenstra, Alice Silverberg
Publication date: 2 September 2019
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.07373
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items (5)
Roots of unity in orders ⋮ Universal gradings of orders ⋮ Algorithms for commutative algebras over the rational numbers ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
Cites Work
- Determining cyclicity of finite modules
- Factoring polynomials with rational coefficients
- Universal gradings of orders
- Algorithms for commutative algebras over the rational numbers
- Roots of unity in orders
- Lattices with symmetry
- Computing the structure of finite algebras
- Revisiting the Gentry-Szydlo Algorithm
- Algorithms in Algebraic Number Theory
- Factoring into coprimes in essentially linear time
- Candidate Multilinear Maps from Ideal Lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Testing Isomorphism of Lattices over CM-Orders
