For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Bit-Serial Squarer in Finite Fields with Characteristic 2
Masakatu MORII Yuzo TAKAMATSU
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/08/25
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Information Theory and Coding Theory
Full Text: PDF(238.8KB)>>
It is important that efficient squaring algorithm is improved since inversion and exponentiation in GF(2m) can be generally decomposed into squaring and multiplying algorithm. In this letter we give a bit-serial squarer in GF(2m) when using polynomial basis representation for the elements.