Fault attacks against the miller algorithm in hessian coordinates

Abstract

In recent years, fault attacks have been developed to be very powerful tools in the field of attack against crypto-algorithm. The basic idea of fault attacks is through provoking disturbances, then an adversary is able to recover some secret data from a carelessly implemented crypto-algorithm. As we known the Miller's algorithm is the critical step for bilinear pairing calculation. Since the Miller's algorithm is usually embedded in identity aware devices such as smart card, a lot of attentions are attracted to analyze these devices. In this paper, we investigate a new approach based on the resolution of a nonlinear system, and this approach has an advantage that the pairing based cryptography in Hessian coordinates is vulnerable to a fault attack. © 2012 Springer-Verlag Berlin Heidelberg.