Title :
Normal basis multiplication algorithm for GF(2n)
Author :
Fan, H. ; Dai, Y.
Author_Institution :
Dept. of Comput. Sci., Tsinghua Univ., Beijing, China
Abstract :
A normal basis multiplication algorithm is presented. Its complexity depends on the multiplicative order of the normal element.
Keywords :
computational complexity; cryptography; microprocessor chips; multiplying circuits; polynomials; GF(2n); Montgomery algorithm; computational complexity; normal basis multiplication algorithm; polynomials;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20045333
