Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Countermeasure against One Physical Cryptanalysis May Benefit Another Attack
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Differential Fault Analysis of Secret Key Cryptosystems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Countermeasures for preventing comb method against SCA attacks
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Hi-index | 0.00 |
In cryptographic devices like a smart card whose computing ability and memory are limited, cryptographic algorithms should be performed efficiently. However, the issue of efficiency sometimes raises vulnerabilities against side channel attacks (SCAs). In elliptic curve cryptosystems, one of main operations is the scalar multiplication. Thus it must be constructed in safety against SCAs. Recently, Hedabou et al. proposed a signed-all-bits set (sABS) recoding as simple power analysis countermeasure, which is also secure against doubling attack (DA). In this paper we propose enhanced doubling attacks which break Hedabou's countermeasure based on sABS recoding, and then show the statistical approach of noise reduction to experiment on the proposed attacks in actuality. We also introduce a countermeasure based on a projective coordinate.