Euclid's Algorithm in Cyclotomic Fields

DOI10.1112/JLMS/S2-10.4.457MaRDI QIDQ4071839zbMATH OpenOpenAlexFDO

Authors H. W. jun. Lenstra

Publication date 1975

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1887/61763

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Cyclotomic extensions (11R18) Arithmetic rings and other special commutative rings (13F99) Integral domains (13G05)

Cited in

(14)

• Homological symbols and the Quillen conjecture.
• Euclidean number fields. I. II. III
• Corps euclidiens, unites exceptionnelles et courbes elliptiques
• Euclidean number fields of large degree
• A public-key cryptosystem utilizing cyclotomic fields
• New number-theoretic cryptographic primitives
• The eleventh power residue symbol
• On Euclidean ideal classes in certain abelian extensions
• Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
• Short Stickelberger class relations and application to Ideal-SVP
• Unit reducible fields and perfect unary forms. II. Cyclotomic fields
• Higher residuosity attacks on small RSA subgroup decision problems
• The characteristic quasi-polynomials for exceptional well-generated complex reflection groups
• Upper bounds for Euclidean minima of algebraic number fields

This page was built for publication: Euclid's Algorithm in Cyclotomic Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071839)