Title :
Alternative to the karatsuba algorithm for software implementations of GF(2n) multiplications
Author :
Fan, H. ; Hasan, M.A.
Author_Institution :
Sch. of Software, Tsinghua Univ., Beijing
fDate :
6/1/2009 12:00:00 AM
Abstract :
A new approach to subquadratic space complexity GF(2n) multipliers has been proposed recently. The corresponding algorithm for software implementations is developed. While its recursive implementation is as simple as that of the Karatsuba algorithm, it requires much less memory to store the look-up table. Therefore it is quite suitable for memory-constrained applications, for example smart cards.
Keywords :
Galois fields; computational complexity; polynomials; table lookup; GF(2n) multiplication; Karatsuba algorithm; look-up table; memory-constrained application; polynomial multiplication; smart card; software implementations; subquadratic space complexity;
Journal_Title :
Information Security, IET
DOI :
10.1049/iet-ifs.2007.0132
