The Community for Technology Leaders
Green Image
Issue No. 09 - September (2011 vol. 60)
ISSN: 0018-9340
pp: 1341-1353
Arash Hariri , The University of Western Ontario, London
Arash Reyhani-Masoleh , The University of Western Ontario, London
Multiplication is one of the most important operations in finite field arithmetic. It is used in cryptographic and coding applications, such as elliptic curve cryptography and Reed-Solomon codes. In this paper, we consider the finite field multiplication used in elliptic curve cryptography and design concurrent error detection circuits. It is shown in the literature that the Montgomery multiplication can be used in cryptography to accelerate the scalar multiplication. Here, we use a parity-based concurrent error detection approach to increase the reliability of different Montgomery multipliers available in the literature. First, we consider bit-serial Montgomery multiplication and propose an error detection circuit. Then, we apply the same technique on the digit-serial Montgomery multiplication. Finally, we consider low time-complexity bit-parallel Montgomery multiplication and design the required components to implement the concurrent error detection circuits. ASIC implementations have been completed to analyze the time and area overheads of the proposed schemes. Also, the error detection capability is investigated by software simulations. We show that our approach results in efficient error detection schemes with small time and area overheads.
Montgomery multiplication, concurrent error detection, finite fields, elliptic curve cryptography.

A. Hariri and A. Reyhani-Masoleh, "Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields," in IEEE Transactions on Computers, vol. 60, no. , pp. 1341-1353, 2010.
94 ms
(Ver 3.3 (11022016))