A high radix montgomery multiplier with concurrent error detection

Author

Zervakis, Georgios ; Eftaxiopoulos, Nikolaos ; Tsoumanis, Kostas ; Axelos, Nicholas ; Pekmestzi, Kiamal

Author_Institution

Dept. of Comput. Sci., Nat. Tech. Univ. of Athens, Athens, Greece

fYear

2014

fDate

16-18 Dec. 2014

Firstpage

199

Lastpage

204

Abstract

Modular multiplication is essential in cryptographic algorithms (e.g. RSA), as it determines the performance of the entire cryptographic operation and its reliability is crucial for the system security. In this paper, we propose a high-radix Montgomery Modular Multiplication (MMM) implementation and conduct an exploration to find the optimal radix. Also, a concurrent error detection circuit with 99.9% detection rate, small area and power overheads (2.24% and 1.46% respectively) is proposed to protect the MMM against fault attacks and natural faults.

Keywords

cryptography; digital arithmetic; error detection; logic design; multiplying circuits; concurrent error detection; cryptographic algorithms; cryptographic operation; fault attacks; high radix Montgomery multiplier; modular multiplication; natural fault; optimal radix; Adders; Algorithm design and analysis; Circuit faults; Computer architecture; Cryptography; Delays; Montgomery modular multiplication; RSA; concurrent error detection; fault attack; high-radix;

fLanguage

English

Publisher

ieee

Conference_Titel

Design & Test Symposium (IDT), 2014 9th International

Conference_Location

Algiers

Type

conf

DOI

10.1109/IDT.2014.7038613

Filename

7038613