𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bit-Parallel Arithmetic Implementations over Finite Fields GF(2m) with Reconfigurable Hardware

✍ Scribed by José Luis Imaña


Book ID
110390473
Publisher
Springer Netherlands
Year
2002
Tongue
English
Weight
139 KB
Volume
73
Category
Article
ISSN
0167-8019

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Efficient bit-parallel multipliers over
✍ 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)