Practical validation of several fault attacks against the Miller algorithm

Abstract : —Pairing based cryptography (PBC) is touted as an efficient approach to address usability and privacy issues in the cyberspace. Like most cryptographic algorithms, PBC must be robust not only against theoretical crypt-analysis but also against practical physical attacks such as fault injections. The computation of the Tate pairing can be divided into two parts, the Miller Algorithm and the Final Exponentiation. In this paper, we describe prac-tical implementations of fault attacks against the Miller Algorithm validating common fault models used against pairings. In the light of the implemented fault attacks, we show that some blinding techniques proposed to protect the algorithm against Side-Channels Analyses cannot be used as countermeasures against the implemented fault attacks.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Paindavoine Marie <>
Submitted on : Friday, January 9, 2015 - 11:03:21 AM
Last modification on : Tuesday, October 23, 2018 - 7:18:02 PM
Long-term archiving on : Friday, April 10, 2015 - 10:21:53 AM


Files produced by the author(s)



Ronan Lashermes, Marie Paindavoine, Nadia El Mrabet, Jacques Jean-Alain Fournier, Louis Goubin. Practical validation of several fault attacks against the Miller algorithm. Fault Diagnosis and Tolerance in Cryptography (FDTC), 2014 Workshop on, Sep 2014, Busan, South Korea. ⟨10.1109/FDTC.2014.21⟩. ⟨hal-01100813⟩



Record views


Files downloads