Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
We propose a new analysis technique against a class of countermeasure using randomized binary signed digit (BSD) representations. We also introduce some invariant properties between BSD representations. The proposed analysis technique can directly recover the secret key from power measurements without information for algorithm because of the invariant properties of BSD representation. Thus the proposed attack is applicable to all countermeasures using BSD representations. Finally, we give the simulation results against some countermeasures using BSD representation such as Ha-Moon method, Ebeid-Hasan method, and the method of Agagliate et al. The results show that the proposed attack is practical analysis method.
- 社団法人電子情報通信学会の論文
- 2006-05-01
著者
-
KIM Tae
Center for Non-crystalline Materials, Department of Materials Science and Engineering, Yonsei Univer
-
Park Young‐ho
Sejong Cyber Univ. Seoul Kor
-
Park Young-ho
Dept. Of Information Security Sejong Cyber Univ.
-
HAN Dong-Guk
Center for Information and Security Technologies (CIST), Korea University
-
OKEYA Katsuyuki
Hitachi, Ltd., Systems Development Laboratory
-
HWANG Yoon
Dept. of Mathematics, Korea University
-
KIM Beomin
Dept. of Philosophy, Korea University
-
Okeya Katsuyuki
Hitachi Ltd. Systems Development Laboratory
-
Kim Beomin
Dept. Of Philosophy Korea University
-
Hwang Yoon
Dept. Of Mathematics Korea University
-
Kim Tae
Center For Information And Security Technologies (cist) Korea University
-
Han Dong-guk
Center For Information And Security Technologies (cist) Korea University
関連論文
- Effect of Carbon Addition on the Microstructural Evolution and Mechanical Properties in Hypo-Eutectic Fe-Zr(-Nb) Alloys
- Efficient Trapdoor Commitment as Secure as Factoring with Useful Properties
- An Efficient Signature Scheme with Fast Online Signing
- Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications
- New Hardware Architecture for Multiplication over GF(2^m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
- Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure(Discrete Mathematics and Its Applications)
- Side Channel Attacks on Message Authentication Codes (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
- Sole Inversion Precomputation for Elliptic Curve Scalar Multiplications
- All Harmonic Numbers Less than 10^
- Side Channel Attacks on Message Authentication Codes
- Side Channel Attacks on Message Authentication Codes