How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Shift Register Sequences
Number Theory in Digital Signal Processing
Number Theory in Digital Signal Processing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Systolic Multipliers for Finite Fields GF(2m)
IEEE Transactions on Computers
IEEE Transactions on Computers - Special issue on computer arithmetic
Efficient Multiplier Architectures for Galois Fields GF(24n)
IEEE Transactions on Computers
IEEE Transactions on Computers
A digit-serial multiplier for finite field GF(2m)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A multiplier to enhance the speed of encryption/decryption
ISP'06 Proceedings of the 5th WSEAS International Conference on Information Security and Privacy
Novel algebraic structure for cyclic codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
| Hi-index | 14.99 |
A new algorithm is presented for computing the product of two elements in a finite field by means of sums and products in a fixed subfield. The algorithm is based on a normal basis representation of fields and assumes that the dimension m of the finite field over the subfield is a highly composite number. A very fast parallel implementation and a considerable reduction in the number of computations are allowed, in comparison to some methods discussed in the literature.