Bit serial multiplication in finite fields

On-Line Error Detection for Bit-Serial Multipliers in GF(2m)

Journal of Electronic Testing: Theory and Applications

Double-Basis Multiplicative Inversion Over GF(2m)

IEEE Transactions on Computers

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases

IEEE Transactions on Computers

Efficient exponentiation using weakly dual basis

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design

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

Architecture For A Low Complexity Rate-Adaptive Reed-Solomon Encoder

IEEE Transactions on Computers

GF(2m) Multiplication and Division Over the Dual Basis

IEEE Transactions on Computers

Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis

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

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

Montgomery Multiplier and Squarer in GF(2m)

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems

A new characterization of dual bases in finite fields and its applications

Discrete Applied Mathematics

More efficient systolic arrays for multiplication in GF(2m) using LSB first algorithm with irreducible polynomials and trinomials

Computers and Electrical Engineering

New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Unified parallel systolic multiplier over GF(2m)

Journal of Computer Science and Technology

Low-complexity bit-parallel multiplier over GF(2m) using dual basis representation

Journal of Computer Science and Technology

Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm

Computers and Electrical Engineering

Unidirectional two dimensional systolic array for multiplication in GF(2m) using LSB first algorithm

WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications

Efficient linear array for multiplication over NIST recommended binary fields

WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications

New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology