Parity-based on-line detection for a bit-parallel systolic dual-basis multiplier over GF(2/sup m/)

The finite field is widely used in error-correcting codes and cryptography. Among its important arithmetic operations, multiplication is identified as the most important and complicated. Therefore, a multiplier with concurrent error detection ability is elegantly needed. In this paper, a concurrent error detection scheme is presented for bit-parallel systolic dual basis multiplier over GF(2^m). The proposed multiplier takes only one extra clock cycle while traditional multipliers using XOR trees consume at least extra XOR gate delays in GF(2^m) fields. Our analysis shows that all single stuck-at faults can be detected concurrently