Title :
Low complexity bit-parallel normal bases multipliers for GF(2n)
Author :
Fan, H. ; Dai, Y.
Author_Institution :
Dept. of Comput. Sci., Tsinghua Univ., Beijing, China
Abstract :
Based on the divide-and-conquer technique, three bit-parallel normal bases multipliers are presented for GF(2n). The space complexity of one multiplier is about 3/4 of the smallest known normal bases multiplier, although it needs at most one more XOR gate delay.
Keywords :
Galois fields; computational complexity; cryptography; digital arithmetic; divide and conquer methods; multiplying circuits; GF(2n) multiplication; XOR gate delay; bit-parallel normal bases multipliers; cryptosystems; divide-and-conquer technique; low complexity multipliers; space complexity; squaring operation;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20040003
