A Euclidean algorithm for normal bases

DOI10.1007/s10440-006-9048-zzbMath1151.11063OpenAlexW2111458214MaRDI QIDQ850785

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

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

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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)

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