Collision-Based Power Attack for RSA with Small Public Exponent

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proposes a new side channel attack to RSA cryptography. Our target is an implementation with a combination of countermeasures. These are an SPA countermeasure by m-ary method and a DPA countermeasure by randomizing exponent techniques. Here, randomizing exponent techniques shows two DPA countermeasures to randomize the secret exponent d. One is an exponent randomizing technique using di = d + riφ(N) to calculate cdi (mod N), and another is a technique using di,1 = ⌊ d/ri ⌋ and di,2 = (d mod ri)) to calculate (cdi,1)ri × cdi,2 (mod N). Using the combination of countermeasures, it was supposed that the implementation is secure against power attack. However, we firstly show the result to successfully attack the implementation of the combination of these countermeasures. We performed the experiment of this search on a PC, and complete d has been successfully revealed less than 10 hours for both attacks.

• 2009-05-01

著者

• ITOH Kouichi

  FUJITSU LABORATORIES Ltd.

• YAMAMOTO Dai

  FUJITSU LABORATORIES Ltd.

• YAJIMA Jun

  FUJITSU LABORATORIES Ltd.

• OGATA Wakaha

  Tokyo Institute of Technology

• Ogata Wakaha

  Tokyo Inst. Of Technol. Tokyo Jpn

• Ogata Wakaha

  Department Of Computer Engineering Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Faculty Of Engineering Tokyo Institute Of Technology

• Ogata Wakaha

  Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Himeji Institute Of Technology

関連論文

• Collision-Based Power Attack for RSA with Small Public Exponent
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
• Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
• Provably Secure On-Line Secret Sharing Scheme
• A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search
• Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• Collision-Based Power Attack for RSA with Small Public Exponent
• Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
• A Practical Countermeasure against Address-bit Differential Power Analysis (特集:プライバシを保護するコンピュータセキュリティ技術)
• Compact Architecture for ASIC Implementation of the MISTY1 Block Cipher
• Small Secret Key Attack on a Takagi's Variant of RSA
• General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
• On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme(Cryptography and Information Security)
• Efficient Divisible Voting Scheme(Application)(Cryptography and Information Security)
• Some new results on nonperfect secret sharing schemes
• Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
• k out of n Oblivious Transfer without Random Oracles (Protocol) (Cryptography and Information Security)
• 4-Move Perfect ZKIP for Some Promise Problems
• Relationship between Standard Model Plaintext Awareness and Message Hiding
• A General Model of Structured Multisignatures with Message Flexibility(Signatures,Cryptography and Information Security)
• Provably Secure On-Line Secret Sharing Scheme
• On Claw Free Families (Special Section on Cryptography and Information Security)
• Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
• k out of n Oblivious Transfer without Random Oracles
• On the Practical Secret Sharing Scheme : Special Section on Cryptography and Information Security
• Reshufflable and Laziness Tolerant Mental Card Game Protocol (Special Section on Cryptography and Information Security)
• A Simple and Efficient Secret Sharing Scheme Secure against Cheating
• Uniqueness Enhancement of PUF Responses Based on the Locations of Random Outputting RS Latches
• Compact Architecture for ASIC and FPGA Implementation of the KASUMI Block Cipher
• Undeniable and Unpretendable Signatures
• Uniqueness Enhancement of PUF Responses Based on the Locations of Random Outputting RS Latches

もっと見る 閉じる

スポンサーリンク