✦ LIBER ✦

A digit-serial multiplier for finite field GF(2/sup m/)

✍ Scribed by Chang Hoon Kim, ; Chun Pyo Hong, ; Soonhak Kwon

Book ID: 120836358
Publisher: IEEE
Year: 2005
Tongue: English
Weight: 709 KB
Volume: 13
Category: Article
ISSN: 1063-8210
DOI: 10.1109/TVLSI.2004.842923

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Digit-serial systolic multiplier for fin

Digit-serial systolic multiplier for finite fields GF(2m)

✍ Guo, J.-H.; Wang, C.-L. 📂 Article 📅 1998 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 598 KB

Bit-serial systolic divider and multipli

Bit-serial systolic divider and multiplier for finite fields GF(2 m)

✍ Hasan, M.A.; Bhargava, V.K. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 680 KB

Systolic array implementation of multipl

Systolic array implementation of multipliers for finite fields GF(2m)

✍ Chin-Liang Wang; Jung-Lung Lin 📂 Article 📅 1991 🏛 IEEE ⚖ 452 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)

A new bit-serial systolic multiplier ove

A new bit-serial systolic multiplier over GF(2m)

✍ Zhou, B.B. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 270 KB