Concurrent Error Detection in Montgomery Multiplication over GF(2m)

Low complexity semi–systolic multiplication architecture over <i>GF</i>(2<i>^m</i>)

“…The proposed architectures have the features of regularity, modularity, concurrency, and unidirectional data flow and thus are well suited for VLSI implementation. [3] et al [4] et al [5] Fig. 1 Fig.…”

“…Wu et al [1] proposed a redundant basis (RB) to embed a finite field into a minimal cyclotomic ring with the elegant multiplicative structure of a cyclic group. A number of systolic multipliers over GFð2 m Þ have been introduced [2,3,4,5]. Recently, Huang et al [5] proposed a semi-systolic multiplier to reduce both time and space complexities.…”

“…Recently, Huang et al [5] proposed a semi-systolic multiplier to reduce both time and space complexities. Chiou et al [4] proposed a semi-systolic Montgomery multiplier (MM) with concurrent error detection capability. However, most existing semi-systolic multipliers suffer from several shortcomings, including large time and/or hardware overhead.…”

Reduced complexity polynomial multiplier architecture for finite fields <i>GF</i>(2<i>^m</i>)

“…As a result, efficient multipliers with low complexity are important from the perspective of system performance. A number of systolic multipliers over GFð2 m Þ have been introduced [3,4,5,6,7]. Lee et al [3] and Chiou et al [4] proposed a semi-systolic multiplier with concurrent error detection.…”

“…A number of systolic multipliers over GFð2 m Þ have been introduced [3,4,5,6,7]. Lee et al [3] and Chiou et al [4] proposed a semi-systolic multiplier with concurrent error detection. Huang et al [5] proposed a semi-systolic multiplier to reduce both time and space complexities.…”