Extended Fault Analysis on Elliptic Curve Cryptosystems against Repeated Doubling

This paper constitutes a fault model on elliptic curve cryptosystems against repeated doubling based on the principle of sign change fault attacks, and presents an improved fault analysis method which can effectively solve the "zero block failure" problem. We attack the elliptic curve cryptosystems with binary method, fixed window method, and also sliding window method in this way. The simulation experiments demonstrate: 15-16 times fault injections are enough to recover full 192-bits key. Because of having similar repeated doubling, the method presented here can provide some ideas for fault attack on other public key cryptosystems.