Algorithmic Number Theory
From MaRDI portal
Publication:5465644
DOI10.1007/b98210zbMath1148.11317OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465644
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98210
Quadratic extensions (11R11) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (3)
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ Public-key cryptosystem based on invariants of diagonalizable groups ⋮ Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings
This page was built for publication: Algorithmic Number Theory
