Introduction to finite fields and their applications
Introduction to finite fields and their applications
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
IEEE Transactions on Computers
VLSI Designs for Multiplication over Finite Fields GF (2m)
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/)
IEEE Transactions on Computers
Montgomery Multiplier and Squarer for a Class of Finite Fields
IEEE Transactions on Computers
Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Fast Normal Basis Multiplication Using General Purpose Processors
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m)
ISC '02 Proceedings of the 5th International Conference on Information Security
Efficient Multiplication Beyond Optimal Normal Bases
IEEE Transactions on Computers
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Fast Normal Basis Multiplication Using General Purpose Processors
IEEE Transactions on Computers
Efficient digit-serial normal basis multipliers over binary extension fields
ACM Transactions on Embedded Computing Systems (TECS)
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers
IEEE Transactions on Computers
Low Complexity Word-Level Sequential Normal Basis Multipliers
IEEE Transactions on Computers
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
Software Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
IEEE Transactions on Computers
WG: A family of stream ciphers with designed randomness properties
Information Sciences: an International Journal
On complexity of normal basis multiplier using modified Booth's algorithm
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
On complexity of normal basis multiplier using modified Booth's algorithm
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
A New Parallel Multiplier for Type II Optimal Normal Basis
Computational Intelligence and Security
Efficient Multiplication Using Type 2 Optimal Normal Bases
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Combined circuit architecture for computing normal basis and montgomery multiplications over GF(2m)
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Unified parallel systolic multiplier over GF(2m)
Journal of Computer Science and Technology
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
Computers and Electrical Engineering
Journal of Signal Processing Systems
An extension of TYT inversion algorithm in polynomial basis
Information Processing Letters
Efficient inversion algorithm for optimal normal bases type II
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
An efficient algorithm for computing inverses in GF(2m) using dual bases
ICCS'03 Proceedings of the 2003 international conference on Computational science
A modified low complexity digit-level Gaussian normal basis multiplier
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Customizable elliptic curve cryptosystems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2m)
International Journal of Autonomous and Adaptive Communications Systems
Modified sequential normal basis multipliers for type II optimal normal bases
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Gauss periods as constructions of low complexity normal bases
Designs, Codes and Cryptography
Pseudorandom number generator using optimal normal basis
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Fast forth power and its application in inversion computation for a special class of trinomials
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Finite field arithmetic using quasi-normal bases
Finite Fields and Their Applications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 15.01 |
This paper presents a new parallel multiplier for the Galois field $GF(2^m)$ whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires $1.5(m^2-m)$ XOR gates, as compared to $2(m^2-m)$ XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar.