Fast Inverters over Finite Field Based on Euclid's Algorithm

Kiyomichi ARAKI  Ikuo FUJITA  Mititada MORISUE  

Publication
IEICE TRANSACTIONS (1976-1990)   Vol.E72   No.11   pp.1230-1234
Publication Date: 1989/11/25
Online ISSN: 
DOI: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Computer Hardware Design
Keyword: 


Full Text: PDF>>
Buy this Article




Summary: 
The arithmetic operations over the finite field GF(pn) has many important applications. There is a need for a fast inverter circuit over the finite field GF(pn), because inversion' is must complicated and lengthy operation. In this paper, we will propose a design method of fast inverter circuit that is based on Euclid's algorithm. The inverter circuit is composed of a number of identical basic circuits. Therefore the designed circuit has a regular and expandable feature and has a modular structure.