DocumentCode
2253896
Title
Some remarks on efficient inversion in finite fields
Author
Paar, Christof
Author_Institution
ECE Dept., Worcester Polytech. Inst., MA, USA
fYear
1995
fDate
17-22 Sep 1995
Firstpage
58
Abstract
This article is concerned with bit parallel inverters over finite fields. Two alternative approaches for inversion with low complexity are reviewed. Both methods are based on multiple field extension of GF(2). It is shown that one architecture is a generalization of the other´s architecture core algorithm. As an example, the complexity of an inverter in the field GF(28) is computed
Keywords
Galois fields; logic gates; Galois field; architecture; bit parallel inverters; core algorithm; efficient inversion; finite fields; inverter; low complexity inversion; multiple field; Arithmetic; Computer architecture; Equations; Galois fields; Hardware; Inverters; Mathematics; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531160
Filename
531160
Link To Document