Burton S. Kaliski Jr. and Yiqun Lisa Yin
Citation: B.S. Kaliski Jr. and Y.L. Yin. Storage-efficient finite
field basis conversion. In S. Tavares and H. Meijer, editors, Selected
Areas in Cryptography ‘98 Proceedings, vol.
1556 of Lecture Notes in Computer Science, Springer, 1999,
pages 81-93. ©
Springer-Verlag
Presented at SAC
‘98, Queen's University, Kingston, Ontario, Canada, August 17-18,
1998.
Abstract: The problem of finite field basis conversion is to convert
from the representation of a field element in one basis to the representation
of the element in another basis. This paper presents new algorithms for
the problem that require much less storage than previous solutions. For
the finite field GF(2m), for example, the storage
requirement of the new algorithms is only O(m) bits, compared
to O(m2) for previous solutions. With the new algorithms, it is
possible to extend an implementation in one basis to support other bases
with little additional cost, thereby providing the desired interoperability
in many cryptographic applications.
Click here for paper
Click here for slides
