A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
From MaRDI portal
Publication:3417022
DOI10.1109/TC.2002.1004590zbMath1231.68041OpenAlexW2114353618MaRDI QIDQ3417022
Arash Reyhani-Masoleh, M. Anwarul Hasan
Publication date: 9 January 2007
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2002.1004590
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Related Items
Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial, Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm, WG: a family of stream ciphers with designed randomness properties, Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials, An extension of TYT inversion algorithm in polynomial basis, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)
