Low complexity normal bases for \(F_{2^{mn}}\)

DOI10.1016/0166-218X(90)90012-2zbMath0706.68060OpenAlexW2022925124MaRDI QIDQ918710

Gérald E. Séguin

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90012-2

zbMATH Keywords

complexity of a normal basisMassey-Omura multiplier for \(F_{2^{mn}}\)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Coding theorems (Shannon theory) (94A24)

Related Items (4)

Almost weakly self-dual bases for finite fields ⋮ Complexity of computation in finite fields ⋮ A new criterion on normal bases of finite field extensions ⋮ Trace-orthogonal normal bases

Cites Work

• Low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)

This page was built for publication: Low complexity normal bases for \(F_{2^{mn}}\)