An efficient optimal normal basis type II multiplier
From MaRDI portal
Publication:3417003
DOI10.1109/12.902754zbMath1231.68042OpenAlexW2096920618MaRDI QIDQ3417003
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5d0d2774a3008c9abce0b1546acf32edc8b5899f
space complexityGalois fieldMassey-Omura multiplierparallel multiplieroptimal normal basis of type II
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Related Items
Finite field arithmetic using quasi-normal bases ⋮ A Euclidean algorithm for normal bases ⋮ Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) ⋮ Finding normal bases over finite fields with prescribed trace self-orthogonal relations ⋮ Unnamed Item ⋮ Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs ⋮ Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields ⋮ Gauss periods as constructions of low complexity normal bases ⋮ WG: a family of stream ciphers with designed randomness properties ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ Polynomial Evaluation and Side Channel Analysis ⋮ On a family of preimage-resistant functions ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)
