Bit-Serial Squarer in Finite Fields with Characteristic 2

Masakatu MORII  Yuzo TAKAMATSU  

Publication
IEICE TRANSACTIONS (1976-1990)   Vol.E73   No.8   pp.1314-1318
Publication Date: 1990/08/25
Online ISSN: 
DOI: 
Print ISSN: 0000-0000
Type of Manuscript: LETTER
Category: Information Theory and Coding Theory
Keyword: 


Full Text: PDF(238.8KB)>>
Buy this Article




Summary: 
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.