Cyclotomic rings with simple Euclidean algorithm

zbMATH Open1248.11082MaRDI QIDQ3103607FDOQ3103607

Authors: Norbert Kaiblinger 

Publication date: 8 December 2011

Full work available at URL: http://www.pphmj.com/abstract/6119.htm

Recommendations

• The Euclidean algorithm for number fields and primitive roots
• scientific article; zbMATH DE number 716515
• Euclid's Algorithm in the Cyclotomic Field Q(ζ 16 )
• scientific article; zbMATH DE number 3910504
• Euclidean Rings of Algebraic Integers

zbMATH Keywords

Euclidean ringcyclotomic number field

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algebraic number theory computations (11Y40) Euclidean rings and generalizations (13F07) Cyclotomic extensions (11R18)

Cited In (3)

• The Rabin cryptosystem revisited
• A sufficient condition of Euclidean rings given by polynomial optimization over a box
• Euclid's Algorithm in the Cyclotomic Field Q(ζ 16 )

This page was built for publication: Cyclotomic rings with simple Euclidean algorithm

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