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
An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
IEEE Transactions on Information Theory
Solved and unsolved problems in number theory
Solved and unsolved problems in number theory
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
A New Algorithm for Multiplication in Finite Fields
IEEE Transactions on Computers
Discrete Applied Mathematics
Characterization for a family of infinitely many irreducible equally spaced polynomials
Information Processing Letters
Efficient Exponentiation of a Primitive Root in GF(2m)
IEEE Transactions on Computers
Efficient Multiplier Architectures for Galois Fields GF(24n)
IEEE Transactions on Computers
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
On-Line Error Detection for Bit-Serial Multipliers in GF(2m)
Journal of Electronic Testing: Theory and Applications
IEEE Transactions on Computers
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases
IEEE Transactions on Computers
Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers
Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems
IEEE Transactions on Computers - Special issue on computer arithmetic
Efficient Normal Basis Multipliers in Composite Fields
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
Equally Spaced Polynomials, Dual Bases, and Multiplication in F2^n
IEEE Transactions on Computers
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
Designs, Codes and Cryptography
A New Hardware Architecture for Operations in GF(2m)
IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
IEEE Transactions on Computers
IEEE Transactions on Computers
Finite Field Multiplier Using Redundant Representation
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
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
Hardware architectures for public key cryptography
Integration, the VLSI Journal
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers
IEEE Transactions on Computers
Ringed bit-parallel systolic multipliers over a class of fields GF(2m)
Integration, the VLSI Journal
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
IEEE Transactions on Computers
A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme
IEEE Transactions on Computers
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
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
Low-complexity bit-parallel multipliers for a class of GF(2m) based on modified Booth's algorithm
International Journal of Computers and Applications
Fast arithmetic architectures for public-key algorithms over Galois fields GF((2n)m)
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Information Processing Letters
| Hi-index | 0.07 |
Structures for parallel multipliers of a class of fields GF(2/sup m/) based on irreducible all one polynomials (AOP) and equally spaced polynomials (ESP) are presented. The structures are simple and modular, which is important for hardware realization. Relationships between an irreducible AOP and the corresponding irreducible ESPs have been exploited to construct ESP-based multipliers of large fields by a regular expansion of the basic modules of the AOP-based multiplier of a small field. Some features of the structures also enable a fast implementation of squaring and multiplication algorithms and therefore make fast exponentiation and inversion possible. It is shown that, if for a certain degree, an irreducible AOP as well as an irreducible ESP exist, then from the complexity point of view, it is advantageous to use the ESP-based parallel multiplier.