A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
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
doi:10.1007/s10836-006-7446-9
fatcat:wlkmh7x2gva6xd5zj7lasfa3hq