Issue No. 07 - July (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.30855
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 computat
algorithm; multiplication; finite fields; sums and products; normal basis representation; highly composite number; parallel implementation; parallel algorithms.
A. Pincin, "A New Algorithm for Multiplication in Finite Fields," in IEEE Transactions on Computers, vol. 38, no. , pp. 1045-1049, 1989.