A survey of Fault Attacks in Pairing Based Cryptography

Abstract : The latest implementations of pairings allow efficient schemes for Pairing Based Cryptography. These make the use of pairings suitable for small and constrained devices (smart phones, smart cards.. .) in addition to more powerful platforms. As for any cryptographic algorithm which may be deployed in insecure locations, these implementations must be secure against physical attacks, and in particular fault attacks. In this paper, we present the state-of-the-art of fault attacks against pairing algorithms, more precisely fault attacks against the Miller algorithm and the final exponentiation which are the two parts of a pairing calculation. 4
Document type :
Other publications
Complete list of metadatas

Cited literature [48 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01197172
Contributor : Nadia El Mrabet <>
Submitted on : Wednesday, September 23, 2015 - 10:18:45 PM
Last modification on : Monday, February 25, 2019 - 4:34:19 PM
Long-term archiving on : Tuesday, December 29, 2015 - 12:23:19 AM

File

ElMrabetDCC2015.pdf
Files produced by the author(s)

Identifiers

Citation

Nadia El Mrabet, Jacques Jean-Alain Fournier, Louis Goubin, Ronan Lashermes. A survey of Fault Attacks in Pairing Based Cryptography. 2015, ⟨10.1007/s12095-014-0114-5"⟩. ⟨hal-01197172⟩

Share

Metrics

Record views

298

Files downloads

228