Paper Info
Title
Fast forth power and its application in inversion computation for a special class of trinomials
Abstract
This contribution is concerned with an improvement of Itoh and Tsujii's algorithm for inversion in finite field GF(2m) using polynomial basis. Unlike the standard version of this algorithm, the proposed algorithm uses forth power and multiplication as main operations. When the field is generated with a special class of irreducible trinomials, an analytical form for fast bit-parallel forth power operation is presented. The proposal can save 1TX compared with the classic approach, where TX is the delay of one 2-input XOR gate. Based on this result, the proposed algorithm for inversion achieves even faster performance, roughly improves the delay by $\frac{m}{2}T_X$, at the cost of slight increase in the space complexity compared with the standard version. To the best of our knowledge, this is the first work that proposes the use of forth power in computation of multiplicative inverse using polynomial basis and shows that it can be efficient.
Year
DOI
Venue
2010
10.1007/978-3-642-12165-4_2
ICCSA
Keywords
Field
DocType
special class,faster performance,polynomial basis,finite field,analytical form,power operation,inversion computation,standard version,fast bit-parallel,classic approach,proposed algorithm,2-input xor gate,space complexity
Polynomial basis,Finite field,Mathematical optimization,Multiplicative inverse,Inversion (meteorology),Computer science,Algorithm,XOR gate,Multiplication,Computation,Trinomial
Conference
Volume
ISSN
ISBN
6017
0302-9743
3-642-12164-0
Citations 
PageRank 
References 
0
0.34
13
Authors
3
Name
Order
Citations
PageRank
Yin Li1112.95
Gong-Liang Chen216013.54
Jian-hua Li355898.16