An SPA-Based Extension of Schindler's Timing Attack against RSA Using CRT(Tamper-Resistance)(<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2005-01-01

著者

• Shimbo Atsushi

  Corporate Research And Development Center Toshiba Corporation

• Miyake Hideyuki

  Corporate Research And Development Center Toshiba Corporation

• TOMOEDA Yuuki

  Corporate Research and Development Center, Toshiba Corporation

• KAWAMURA Shinichi

  Corporate Research and Development Center, Toshiba Corporation

• Kawamura Shinichi

  Corporate Research And Development Center Toshiba Corporation

• Kawamura Shinichi

  Corporate Research & Development Center Toshiba Corporation

• Tomoeda Yuuki

  Corporate Research And Development Center Toshiba Corporation

• SHIMBO Atsushi

  Corporate Research & Development Center, Toshiba Corporation

関連論文

• An SPA-Based Extension of Schindler's Timing Attack against RSA Using CRT(Tamper-Resistance)(Cryptography and Information Security)
• RNS Montgomery Multiplication Algorithm for Duplicate Processing of Base Transformations(Special Section on Cryptography and Information Security)

スポンサーリンク