✦ LIBER ✦

Low-Complexity Multiplier for $GF(2^{m})$ Based on All-One Polynomials

✍ Scribed by Xie, Jiafeng; Meher, Pramod Kumar; He, Jianjun

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low complexity bit-parallel multiplier f

✍ Ku-Young Chang; Dowon Hong; Hyun-Sook Cho 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 254 KB

Low latency systolic multipliers for fin

✍ Jia-feng Xie; Jian-jun He; Wei-hua Gui 📂 Article 📅 2012 🏛 Central South University 🌐 English ⚖ 550 KB

Low-complexity multiplexer-based normal

✍ Jenn-Shyong Horng; I-Chang Jou; Chiou-Yng Lee 📂 Article 📅 2009 🏛 SP Zhejiang University Press 🌐 English ⚖ 230 KB

Bit-parallel systolic multipliers for GF

✍ Chiou-Yng Lee; Erl-Huei Lu; Jau-Yien Lee 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 444 KB

Low Latency Systolic Montgomery Multipli

✍ Xie, Jiafeng; He, Jian jun; Meher, Pramod Kumar 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 858 KB

Fast inversion algorithm in GF(2m) suita

✍ Kobayashi, K.; Takagi, N.; Takagi, K. 📂 Article 📅 2012 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 144 KB