Name
Abstract | ||
|---|---|---|
At CHES 2000, Schindler introduced a timing attack that enables the factorization of an RSA-modulus if RSA implementations use the Chinese Remainder Theorem and Montgomery multiplication. In this paper we introduce another approach for deriving the secret prime factor by focusing on the conditional branch Schindler used in his attack. One of the countermeasures against Schindler's attack is the blinding method. If input data are blinded with a fixed value or short-period random numbers. Schindler's attack does not work but our method can still factorize the RSA-modulus. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1093/ietfec/E88-A.1.147 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
SPA, timing attack, Montgomery multiplication, RSA, Chinese Remainder Theorem | Blinding,Chinese remainder theorem,Montgomery reduction,Arithmetic,Theoretical computer science,Timing attack,Factorization,Prime factor,Mathematics | Journal |
Volume | Issue | ISSN |
E88A | 1 | 0916-8508 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuuki Tomoeda | 1 | 1 | 0.37 |
| Hideyuki Miyake | 2 | 3 | 1.43 |
| Atsushi Shimbo | 3 | 142 | 10.32 |
| Shinichi Kawamura | 4 | 255 | 22.99 |