Abstract
Conversion of finite field elements from one basis representation to another representation in a storage-efficient manner is crucial if these techniques are to be carried out in hardware for cryptographic applications. We present algorithms for conversion to and from dual of polynomial and dual of normal bases, as well as algorithms to convert to a polynomial or normal basis which involve the dual of the basis. This builds on work by Kaliski and Yin presented at SAC ’98.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
IEEE P1363: Standard Specifications for Public-Key Cryptography, draft 11, July 1999. http://grouper.ieee.org/groups/1363/draft.html.
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, volume 1556 of Lecture Notes in Computer Science, pages 81–93. Springer, 1999.
R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and Its Applications. Addison-Wesley, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaliski, B.S., Liskov, M. (1999). Efficient Finite Field Basis Conversion Involving dual bases. In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems. CHES 1999. Lecture Notes in Computer Science, vol 1717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48059-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-48059-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66646-2
Online ISBN: 978-3-540-48059-4
eBook Packages: Springer Book Archive