A Euclidean algorithm for normal bases

DOI10.1007/S10440-006-9048-ZMaRDI QIDQ850785zbMATH OpenOpenAlexFDO

Authors Berk Sunar

Publication date 6 November 2006

Published in Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10440-006-9048-z

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic theory of polynomial rings over finite fields (11T55)

Recommendations

• An algorithm for the construction of a normal basis
• Euclidean algorithm in different norms
• Algorithms to construct normal bases of cyclic number fields
• scientific article; zbMATH DE number 3853202
• scientific article; zbMATH DE number 3192959
• scientific article; zbMATH DE number 3891489
• scientific article; zbMATH DE number 1254272
• Euclidean algorithm for a class of linear orders
• The Euclidean algorithm in algebraic number fields
• scientific article; zbMATH DE number 3875409

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 1852855 (Why is no real title available?)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• An efficient optimal normal basis type II multiplier
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)

Cited in

(1)

• Itoh-Tsujii inversion in standard basis and its application in cryptography and codes

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A Euclidean algorithm for normal bases

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