✦ LIBER ✦

Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation

✍ Scribed by Chiou-Yng Lee; Jenn-Shyong Horng; I-Chang Jou

Book ID: 106577799
Publisher: Springer
Year: 2006
Tongue: English
Weight: 319 KB
Volume: 21
Category: Article
ISSN: 1000-9000
DOI: 10.1007/s11390-006-0887-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-complexity bit-parallel systolic mul

Low-complexity bit-parallel systolic multipliers over GF(2m)

✍ Chiou-Yng Lee 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 254 KB

A dual basis bit-serial systolic multipl

A dual basis bit-serial systolic multiplier for GF(2m)

✍ S.T.J. Fenn; D. Taylor; M. Benaissa 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Efficient bit-parallel multipliers over

Efficient bit-parallel multipliers over finite fields GF(2m)

✍ Chiou-Yng Lee; Pramod Kumar Meher 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Hardware implementation of multiplication in finite field GF(2 m ) based on sparse polynomials is found to be advantageous in terms of space-complexity as well as the time-complexity. In this paper, we present a new permutation method to construct the irreducible like-trinomials of the form (x + 1)

Low complexity bit-parallel systolic arc

Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)

✍ Yeun-Renn Ting; Erl-Huei Lu; Jau-Yien Lee 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 288 KB

New Bit-Parallel Systolic Architectures

New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations

✍ Chiou-Yng Lee; Che Wun Chiou 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 289 KB