Fault-based triangular basis multiplication over GF(2^m) using bit-level parity prediction scheme

Recently, many researchers have proved that cryp- tosystems can be easily broken by the fault based side-channel cryptanalysis. To fight against such fault based side-channel cryptanalysis, a bit-parallel triangular basis systolic multiplier with on-line error detection capability is then presented. The architecture is used by a bit-level parity prediction scheme to detect even-multiple and odd-multiple errors in triangular basis multiplication, and then saves about 77% space complexity as compared to traditional fault-based multipliers.