Efficient Finite Field Basis Conversion Involving Dual Bases

Authors:
Burton S. Kaliski, Jr.;Moses Liskov
Affiliations:
-;-
Venue:
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Year:
1999

Citing 1
Cited 4

Storage-Efficient Finite Field Basis Conversion

SAC '98 Proceedings of the Selected Areas in Cryptography

Efficient Software Implementation for Finite Field Multiplication in Normal Basis

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Constructing Composite Field Representations for Efficient Conversion

IEEE Transactions on Computers
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations

IEEE Transactions on Computers
Efficient Multiplication Using Type 2 Optimal Normal Bases

WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields

Quantified Score

Hi-index	0.01

Visualization

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.