Roots of unity in orders

DOI10.1007/s10208-016-9304-1zbMath1384.16012arXiv1509.02612OpenAlexW2159115428MaRDI QIDQ2362292

Alice Silverberg, Hendrik W. jun. Lenstra

Publication date: 7 July 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.02612

zbMATH Keywords

ordersalgorithmsidempotentsdiscrete logarithm problemroots of unity

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Other algebras and orders, and their zeta and (L)-functions (11R54) General commutative ring theory (13A99) Commutative orders (16H15)

Related Items (4)

Lattices with symmetry ⋮ Realizing orders as group rings ⋮ Algorithms for commutative algebras over the rational numbers ⋮ Testing Isomorphism of Lattices over CM-Orders

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Revisiting the Gentry-Szydlo Algorithm
• Testing Isomorphism of Lattices over CM-Orders

This page was built for publication: Roots of unity in orders