✦ LIBER ✦

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

✍ Scribed by Chin-Liang Wang; Jung-Lung Lin

Book ID: 114559550
Publisher: IEEE
Year: 1991
Weight: 452 KB
Volume: 38
Category: Article
ISSN: 0098-4094
DOI: 10.1109/31.135751

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

Dual basis systolic multipliers for GF(2

Dual basis systolic multipliers for GF(2m)

✍ Fenn, S.T.J.; Benaissa, M.; Taylor, O. 📂 Article 📅 1997 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 374 KB

Low latency systolic multipliers for fin

Low latency systolic multipliers for finite field GF (2m) based on irreducible polynomials

✍ Jia-feng Xie; Jian-jun He; Wei-hua Gui 📂 Article 📅 2012 🏛 Central South University 🌐 English ⚖ 550 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)

Structure of parallel multipliers for a

Structure of parallel multipliers for a class of fields GF(2m)

✍ Toshiya Itoh; Shigeo Tsujii 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 931 KB

Low-complexity bit-parallel systolic Mon

Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2m)

✍ Chiou-Yng Lee; Jenn-Shyong Horng; I-Chang Jou; Erl-Huei Lu 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 818 KB