Efficient unified semi-systolic arrays for multiplication and squaring over GF(2m)
- 1 January 2017
- journal article
- research article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Electronics Express
- Vol. 14 (12) , 20170458
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A semi-systolic Montgomery multiplier over GF(2m)IEICE Electronics Express, 2015
- Efficient systolic modular multiplier/squarer for fast exponentiation over GF(2m)IEICE Electronics Express, 2015
- Polynomial Basis Multiplier Using Cellular Systolic ArchitectureIETE Journal of Research, 2014
- Concurrent error detection and correction in a polynomial basis multiplier over GF (2
m
)IET Information Security, 2010
- Bipartite Modular Multiplication MethodIEEE Transactions on Computers, 2008
- Concurrent Error Detection in Montgomery Multiplication over GF(2m)IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
- Linear systolic multiplier/squarer for fast exponentiationInformation Processing Letters, 2000
- A common-multiplicand method to the montgomery algorithm for speeding up exponentiationInformation Processing Letters, 1998
- Architectures for exponentiation in GF(2/sup m/)IEEE Journal on Selected Areas in Communications, 1988
- Modular multiplication without trial divisionMathematics of Computation, 1985