On the Vulnerability of Exponent Recodings for the Exponentiation against Side Channel Attacks(Tamper-Resistance)(<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and countermeasures for public key cryptosystems were against the main stage (square and multiply stage) of the modular exponentiation (or the point multiplication on an elliptic curve). We have many algorithms which achieve fast computation of exponentiations. When we compute an exponentiation, the exponent recoding has to be carried out before the main stage. There are some exponent recoding algorithms including conditional branches, in which instructions depend on the given exponent value. Consequently exponent recoding can constitute an information channel, providing the attacker with valuable information on the secret exponent. In this paper we show new algorithms of attack on exponent recoding. The proposed algorithms can recover the secret exponent, when the width-ω NAF [9] and the unsigned/signed fractional window representation [5] are used.
- 社団法人電子情報通信学会の論文
- 2005-01-01
著者
-
Sakurai Kouichi
Department Of Computer Science And Communication Engineering Faculty Of Information Science And Elec
-
Sakai Yasuyuki
Information Technology R&d Center Mitsubishi Electric Corporation
-
Sakurai Kouichi
Department Of Computer Sicence Kyushu University
-
Sakurai Kouichi
Department Of Applied Science Faculty Of Engineering 36 Kyushu University
関連論文
- On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis (Special Section on Cryptography and Information Security)
- Password-Authenticated Key Exchange for Multi-Party with Different Passwords Using a Constant Number of Rounds
- Password-Authenticated Key Exchange for Multi-Party with Different Passwords Using a Constant Number of Rounds
- Analysis and Comparison of Crytographic Techniques in E-voting and E-auction
- 1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption
- Reliable Key Distribution Scheme for Lossy Channels
- D-031 Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
- Private Data Clustering based on Secure Approximation
- Analysis and Design for Private Message Board Systems
- On the Complexity of the Discrete Logarithm for a General Finite Group (Special Section on Cryptography and Information Security)
- Improved Subset Difference Method with Ternary Tree
- Towards a Fairness Multimedia Transmission Using Layered-Based Multicast Protocol
- Simple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems(Side Channel Analysis, Cryptography and Information Security)
- On the Vulnerability of Exponent Recodings for the Exponentiation against Side Channel Attacks(Tamper-Resistance)(Cryptography and Information Security)
- Changes to Quantum Cryptography
- Proposal and Analysis of a Distributed Online Certificate Status Protocol with Low Communication Cost(Application)(Cryptography and Information Security)
- Analysis and Design for Private Message Board Systems (Applications) (Cryptography and Information Security)
- Special Section on Discrete Mathematics and Its Applications
- Timing Attacks against a Parallelized RSA Implementation (特集:プライバシを保護するコンピュータセキュリティ技術)
- Securing Provenance of Distributed Processes in an Untrusted Environment
- Equivalence problem and automorphisms of some abelian branched coverings of the Riemann sphere