Improved normal basis inversion in GF (2 m )
Author:
- Sungming YenSYSungming Yen
- 30 January 1997
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 33 (3) , 196-197
Abstract
Recently, Fenn et al. developed a fast finite field inversion algorithm in GF(2m) over the normal basis representation which uses about half the time complexity of traditional approaches. Further extensive improvement to this algorithm is presented here.Keywords
This publication has 6 references indexed in Scilit:
- Fast normal basis inversion in GF (2
m
)Electronics Letters, 1996
- Fast exponentiation methodby folding exponent in halfElectronics Letters, 1996
- Finite field inversion over the dual basisIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1996
- Improved generalisation common-multiplicandmultiplications algorithm of Yen and LaihElectronics Letters, 1995
- Common-multiplicand multiplication and its applications to public key cryptographyElectronics Letters, 1993
- The Art of Computer Programming. Vol. II: Seminumerical AlgorithmsMathematics of Computation, 1970