A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Lattice Attacks on Digital Signature Schemes
Designs, Codes and Cryptography
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Complexity of Lattice Problems
Complexity of Lattice Problems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
ISC '01 Proceedings of the 4th International Conference on Information Security
ISC '02 Proceedings of the 5th International Conference on Information Security
A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks
ISC '02 Proceedings of the 5th International Conference on Information Security
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Designs, Codes and Cryptography
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Improved techniques for fast exponentiation
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Experimenting with faults, lattices and the DSA
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
| Hi-index | 0.00 |
In this paper, we will report practical modifications of the side-channel analysis to (EC)DSA [1, 2, 4, 31] that Leadbitter et al. have proposed in [12]. To apply the analyses, we assume that the window method is used in the exponentiation (EC scalar multiplication) calculation and the side-channel information described in Section [2] can be collected. So far, the method in [12] haven't been effective when q is 160 bit long and the window size w q is 160 bit long and w=4, that is, in the case of frequent implementation. First, we estimate the window size w necessary for the proposed analyses (attacks) to succeed. Then by experiment of the new method, we show that private keys of (EC)DSA can be obtained under the above assumptions, in practical time and with sufficient success rate. The result raises the necessity of countermeasures against the analyses (attacks) in the window method based implementation of (EC)DSA.