VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
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
IEEE Transactions on Computers - Special issue on computer arithmetic
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
Mastrovito Multiplier for All Trinomials
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers
Efficient Normal Basis Multipliers in Composite Fields
IEEE Transactions on Computers
An Efficient Optimal Normal Basis Type II Multiplier
IEEE Transactions on Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/)
IEEE Transactions on Computers
A new hardware architecture for operations In GF (2m)
IEEE Transactions on Computers
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
IEEE Transactions on Computers
Montgomery Multiplier and Squarer for a Class of Finite Fields
IEEE Transactions on Computers
A New Hardware Architecture for Operations in GF(2m)
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Efficient Normal Basis Multiplication
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
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
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A New Low Complexity Parallel Multiplier for a Class of Finite Fields
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Low Complexity Multiplication in a Finite Field Using Ring Representation
IEEE Transactions on Computers
Efficient Multiplication Beyond Optimal Normal Bases
IEEE Transactions on Computers
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Parallel Multipliers Based on Special Irreducible Pentanomials
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
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three
IEEE Transactions on Computers
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)
IEEE Transactions on Computers
Ringed bit-parallel systolic multipliers over a class of fields GF(2m)
Integration, the VLSI Journal
Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m)
Journal of Electronic Testing: Theory and Applications
IEEE Transactions on Computers
Bit-Parallel Finite Field Multipliers for Irreducible Trinomials
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
Journal of Electronic Testing: Theory and Applications
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
IEEE Transactions on Computers
Efficient parallel multiplier in shifted polynomial basis
Journal of Systems Architecture: the EUROMICRO Journal
LFSR multipliers over GF(2m) defined by all-one polynomial
Integration, the VLSI Journal
IEEE Transactions on Computers
A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme
IEEE Transactions on Computers
Low complexity bit parallel multiplier for GF (2m) generated by equally-spaced trinomials
Information Processing Letters
A novel approach for bit-serial AB2 multiplication in finite fields GF(2m)
Computers & Mathematics with Applications
A New Parallel Multiplier for Type II Optimal Normal Basis
Computational Intelligence and Security
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
Montgomery exponent architecture based on programmable cellular automata
Mathematics and Computers in Simulation
New stream ciphers based on elliptic curve point multiplication
Computer Communications
Improved throughput bit-serial multiplier for GF(2m) fields
Integration, the VLSI Journal
Implementation and analysis of stream ciphers based on the elliptic curves
Computers and Electrical Engineering
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
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
Ringed bit-parallel systolic multipliers over a class of fields GF(2m)
Integration, the VLSI Journal
Journal of Signal Processing Systems
A high-speed word level finite field multiplier in F2m using redundant representation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low-complexity bit-parallel multipliers for a class of GF(2m) based on modified Booth's algorithm
International Journal of Computers and Applications
An extension of TYT inversion algorithm in polynomial basis
Information Processing Letters
Computational algorithm and architecture for AB2 multiplication in finite fields
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Information Processing Letters
Modified serial multipliers for Type-IV gaussian normal bases
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Concurrent error detection architectures for field multiplication using gaussian normal basis
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Integration, the VLSI Journal
Low-power and high-speed design of a versatile bit-serial multiplier in finite fields GF(2m)
Integration, the VLSI Journal
Utilization of Pipeline Technique in AOP Based Multipliers with Parallel Inputs
Journal of Signal Processing Systems
Information Processing Letters
| Hi-index | 15.05 |
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m2$-$ 1 XOR gates and m2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.