๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Unified Parallel Systolic Multiplier Over({it GF}(2^{m}))

โœ Scribed by Chiou-Yng Lee; Yung-Hui Chen; Che-Wun Chiou; Jim-Min Lin

Book ID
106577823
Publisher
Springer
Year
2007
Tongue
English
Weight
518 KB
Volume
22
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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)