Keyword : shifted polynomial basis


Low Complexity Bit-Parallel Squarer for GF(2n) Defined by Irreducible Trinomials
Sun-Mi PARK Ku-Young CHANG 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/09/01
Vol. E89-A  No. 9 ; pp. 2451-2452
Type of Manuscript:  LETTER
Category: Algorithms and Data Structures
Keyword: 
finite field arithmeticbit-parallel squarertrinomialshifted polynomial basis
 Summary | Full Text:PDF