Fan
Abstract
It is shown that if 2 is a primitive root mod prime n+1 and GF(2n) is generated by an irreducible all one polynomial (AOP) then a simple multiplication algorithm exists over the field GF(2n).
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is shown that if 2 is a primitive root mod prime n+1 and GF(2n) is generated by an irreducible all one polynomial (AOP) then a simple multiplication algorithm exists over the field GF(2n).
Key concepts: GF(2), Multiplication (music), Simple (philosophy), Multiplication algorithm, Primitive polynomial, Prime (order theory), Finite field, Mathematics