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{\ldots}) 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01579820
Contributor : Nadia El Mrabet <>
Submitted on : Thursday, August 31, 2017 - 4:36:18 PM
Last modification on : Thursday, March 14, 2019 - 8:30:10 PM

Identifiers

Citation

Nadia El Mrabet, Ronan Lashermes, Jacques Jean-Alain Fournier, Louis Goubin. A survey of Fault attacks in Pairing Based Cryptography. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences , Springer, 2015, 7 (1), pp.185--205. ⟨https://doi.org/10.1007/s12095-014-0114-5⟩. ⟨10.1007/s12095-014-0114-5⟩. ⟨hal-01579820⟩

Share

Metrics

Record views

306