Optimal normal bases in GF(pn)
Discrete Applied Mathematics
IEEE Transactions on Computers - Special issue on computer arithmetic
Designs, Codes and Cryptography
On orders of optimal normal basis generators
Mathematics of Computation
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
An Efficient Optimal Normal Basis Type II Multiplier
IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
IEEE Transactions on Computers
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers
IEEE Transactions on Computers
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
IEEE Transactions on Computers
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
A modified low complexity digit-level Gaussian normal basis multiplier
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Type-II optimal polynomial bases
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Speedup of bit-parallel Karatsuba multiplier in GF(2 m) generated by trinomials
Information Processing Letters
Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
Journal of Signal Processing Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 14.98 |
Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases.