Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
Mastrovito Multiplier for All Trinomials
IEEE Transactions on Computers
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases
IEEE Transactions on Computers
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers
IEEE Transactions on Computers
Montgomery Multiplier and Squarer for a Class of Finite Fields
IEEE Transactions on Computers
IEEE Transactions on Computers
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
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
Parallel Multipliers Based on Special Irreducible Pentanomials
IEEE Transactions on Computers
Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms
IEEE Transactions on Computers
Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis
IEEE Transactions on Computers
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
Low-complexity bit-parallel systolic multipliers over GF(2m)
Integration, the VLSI Journal
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
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
Efficient bit-parallel multipliers over finite fields GF(2m)
Computers and Electrical Engineering
Speedup of bit-parallel Karatsuba multiplier in GF(2 m) generated by trinomials
Information Processing Letters
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
Formulas for cube roots in F3m using shifted polynomial basis
Information Processing Letters
| Hi-index | 14.99 |
Based on a new representation of GF(2^n), we present two multipliers for all irreducible trinomials. Space complexities of the multipliers match the best results. The time complexity of one multiplier is T_A + (1 + \left\lceil {\log _2 n}\right\rceil )T_X for all irreducible trinomials, where T_A and T_X are the delay of one 2-input AND and XOR gates, respectively.