DocumentCode
1331261
Title
Fast normal basis inversion in GF(2m)
Author
Fenn, S.T.J. ; Benaissa, M. ; Taylor, D.
Author_Institution
Div. of Electron. & Commun. Syst., Huddersfield Univ., UK
Volume
32
Issue
17
fYear
1996
fDate
8/15/1996 12:00:00 AM
Firstpage
1566
Lastpage
1567
Abstract
A method for performing finite field inversion over the normal basis is presented. This approach is based around Fermat´s theorem but takes approximately half the number of clock cycles to generate a solution compared to traditional techniques. The overhead for this reduced time complexity is a slight increase in hardware
Keywords
BCH codes; Galois fields; Reed-Solomon codes; combinational circuits; computational complexity; decoding; digital arithmetic; error correction codes; mathematics computing; Fermat theorem; fast normal basis inversion; finite field inversion; time complexity reduction;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19961036
Filename
533294
Link To Document