DocumentCode
3451791
Title
Montgomery Multiplication with Redundancy Check
Author
Nguyen, Khanh ; Tunstall, Michael
fYear
2007
fDate
10-10 Sept. 2007
Firstpage
30
Lastpage
36
Abstract
This paper presents a method of adding redundant code to the Montgomery multiplication algorithm, to ensure that a fault attack during its calculation can be detected. This involves having checksums on the input variables that are then used to calculate a valid checksum for the output variable, in a similar manner to that proposed by Walter. However, it is shown that the proposed method is more secure than the previous work, as all the variables required to calculate Montgomery multiplication are protected.
Keywords
cryptography; Montgomery multiplication; checksums; fault attack; redundancy check; redundant code; Algorithm design and analysis; Educational institutions; Fault detection; Fault diagnosis; Input variables; Protection; Public key cryptography; Redundancy; Security; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault Diagnosis and Tolerance in Cryptography, 2007. FDTC 2007. Workshop on
Conference_Location
Vienna
Print_ISBN
978-0-7695-2982-0
Type
conf
DOI
10.1109/FDTC.2007.14
Filename
4318982
Link To Document