✦ LIBER ✦

Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$

✍ Scribed by Talapatra, Somsubhra; Rahaman, Hafizur; Mathew, Jimson

Book ID: 121188278
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 462 KB
Volume: 18
Category: Article
ISSN: 1063-8210
DOI: 10.1109/TVLSI.2009.2016753

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Modular construction of low complexity p

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)

✍ Hasan, M.A.; Wang, M.; Bhargava, V.K. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 777 KB

Low complexity bit-parallel systolic arc

Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)

✍ Yeun-Renn Ting; Erl-Huei Lu; Jau-Yien Lee 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 288 KB

[ACM Press the 2005 conference - Shangha

[ACM Press the 2005 conference - Shanghai, China (2005.01.18-2005.01.21)] Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05 - A fast digit-serial systolic multiplier for finite field GF (2 m )

✍ Kim, Chang Hoon; Kwon, Soonhak; Hong, Chun Pyo 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 701 KB

[ACM Press the 2005 conference - Shangha

✍ Kim, Chang Hoon; Kwon, Soonhak; Hong, Chun Pyo 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 701 KB

This paper presents a new digit-serial systolic multiplier over GF (2 m ) for cryptographic applications. When input data come in continuously, the proposed array produces multiplication results at a rate of one every m/D + 2 clock cycles, where D is the selected digit size. Since the inner structur