Title :
Simple multiplication algorithm for a class of GF(2n)
Author_Institution :
Dept. of Comput. Sci., Inst. of Commun. Eng., Nanjing, China
fDate :
3/28/1996 12:00:00 AM
Abstract :
It is shown that if 2 is a primitive root mod prime n+1 and GF(2 n) is generated by an irreducible all one polynomial (AOP) then a simple multiplication algorithm exists over the field GF(2n )
Keywords :
combinatorial mathematics; digital arithmetic; number theory; polynomials; GF(2n) field; multiplication algorithm; polynomial; primitive root mod prime;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19960416
