Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)

Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin
2006 Journal of electronic testing  
Eliminating cryptographic computation errors is vital for preventing attacks. A simple approach is to verify the correctness of the cipher before outputting it. The multiplication is the most significant arithmetic operation among the cryptographic computations. Hence, a multiplier with concurrent error detection ability is urgently necessary to avert attacks. Employing the re-computing shifted operand concept, this study presents a semi-systolic array polynomial basis multiplier with
more » ... error detection with minimal area overhead. Moreover, the proposed multiplier requires only two extra clock cycles while traditional multipliers using XOR trees consume at least log 2 m extra XOR gate delays in GF(2 m ) fields.
doi:10.1007/s10836-006-7446-9 fatcat:wlkmh7x2gva6xd5zj7lasfa3hq