✦ LIBER ✦

Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)

✍ Scribed by Rahaman, H.; Mathew, J.; Pradhan, D.K.; Jabir, A.M.

Book ID: 118698056
Publisher: IEEE
Year: 2008
Tongue: English
Weight: 661 KB
Volume: 57
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.2008.63

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

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)

Single error correctable bit parallel mu

Single error correctable bit parallel multipliers over GF(2m)

✍ Mathew, J.; Jabir, A.M.; Rahaman, H.; Pradhan, D.K. 📂 Article 📅 2009 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 389 KB

Low complexity bit-parallel systolic mul

Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials

✍ Chiou-Yng Lee 📂 Article 📅 2003 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 238 KB

Low-Complexity Bit-Parallel Multiplier o

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

✍ Chiou-Yng Lee; Jenn-Shyong Horng; I-Chang Jou 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 319 KB

Non-XOR approach for low-cost bit-parall

Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2m)

✍ Huang, W.-T.; Chang, C.H.; Chiou, C.W.; Tan, S.-Y. 📂 Article 📅 2011 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 896 KB