Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
From MaRDI portal
Publication:3417016
DOI10.1109/12.660172zbMath1231.68039OpenAlexW2145254449MaRDI QIDQ3417016
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/0579af5b69503da2515ffc6491ff449b042436b9
finite fieldsall-one-polynomiallow-complexity bit-parallel canonical basis multipliernormal basis multipliers
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Related Items (13)
A Euclidean algorithm for normal bases ⋮ Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) ⋮ Programmable cellular automata based Montgomery hardware architecture ⋮ Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial ⋮ 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 ⋮ Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm ⋮ A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) ⋮ Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ Montgomery exponent architecture based on programmable cellular automata ⋮ A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m) ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)
This page was built for publication: Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
