Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/FDTC.2007.9 | FDTC |
Keywords | Field | DocType |
cryptography,montgomery multiplication,checksums,redundant code | Checksum,Computer science,Cryptography,Montgomery reduction,Parallel computing,Redundant code,Theoretical computer science,Redundancy (engineering),Longitudinal redundancy check,Fault attack | Conference |
ISBN | Citations | PageRank |
0-7695-2982-8 | 4 | 0.59 |
References | Authors | |
19 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khanh Nguyen | 1 | 128 | 10.39 |
| Michael Tunstall | 2 | 4 | 0.59 |