Title :
A new algorithm for multiplication in finite fields
Author_Institution :
Siemens Telecommun., Milan, Italy
fDate :
7/1/1989 12:00:00 AM
Abstract :
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
Keywords :
parallel algorithms; algorithm; finite fields; highly composite number; multiplication; normal basis representation; parallel implementation; sums and products; Computer architecture; Concurrent computing; Digital signal processing; Error correction codes; Galois fields; Parallel algorithms; Signal generators; Signal processing algorithms; Telecommunication computing; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
