Another Look at Inversions over Binary Fields

Another Look at Inversions over Binary Fields

In this paper we offer new algorithms for one of the most common operations in public key cryptosystems: the inversion over binary Galois fields. The new algorithms are based on using double-base and triple-base representations. They are provably more economical-in terms of the average number of mul...

Full description

Saved in:
Bibliographic Details
Published in:2013 IEEE 21st Symposium on Computer Arithmetic pp. 211 - 218
Main Authors: Dimitrov, V., Jarvinen, K.
Format: Conference Proceeding
Language:English
Published: IEEE 01-04-2013
Subjects:
Algorithm design and analysis
NIST
Polynomials
Prediction algorithms
Signal processing algorithms
Software
Software algorithms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we offer new algorithms for one of the most common operations in public key cryptosystems: the inversion over binary Galois fields. The new algorithms are based on using double-base and triple-base representations. They are provably more economical-in terms of the average number of multiplications-than the popular Itoh-Tsujii algorithm. In addition to having fewer multiplications, the new inversion algorithms offer further implementation advantages because they allow more efficient computation of squarings and, in some cases, require fewer temporary variables. The new algorithms are straightforwardly usable in both software and hardware implementations.
ISBN:9781467356442
1467356441
ISSN:1063-6889
DOI:10.1109/ARITH.2013.25