Low Complexity Bit-Parallel Squarer for GF(2n) Defined by Irreducible Trinomials Sun-Mi PARKKu-Young CHANG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/09/01 Vol. E89-ANo. 9pp. 2451-2452 Type of Manuscript: LETTER Category: Algorithms and Data Structures Keyword: finite field arithmetic, bit-parallel squarer, trinomial, shifted polynomial basis,