Optimal Extension Field Inversion in the Frequency Domain

Authors:
Selçuk Baktır;Berk Sunar
Affiliations:
WPI, Cryptography & Information Security Laboratory, Worcester, USA;WPI, Cryptography & Information Security Laboratory, Worcester, USA
Venue:
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Year:
2008

Citing 10
Cited 0

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Elliptic curve cryptography on smart cards without coprocessors

Proceedings of the fourth working conference on smart card research and advanced applications on Smart card research and advanced applications
DFT/FFT and Convolution Algorithms: Theory and Implementation

DFT/FFT and Convolution Algorithms: Theory and Implementation
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

Designs, Codes and Cryptography
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform

Proceedings of the 44th annual Southeast regional conference
Spectral Modular Exponentiation

ARITH '07 Proceedings of the 18th IEEE Symposium on Computer Arithmetic
A state-of-the-art elliptic curve cryptographic processor operating in the frequency domain

Mobile Networks and Applications
Finite field polynomial multiplication in the frequency domain with application to elliptic curve cryptography

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an adaptation of the Itoh-Tsujii algorithmto the frequency domain for efficient inversion in a class of Optimal Extension Fields. To the best of our knowledge, this is the first time a frequency domain finite field inversion algorithm is proposed for elliptic curve cryptography. We believe the proposed algorithm would be well suited especially for efficient low-power hardware implementation of elliptic curve cryptography using affine coordinates in constrained small devices such as smart cards and wireless sensor network nodes.