Cryptology ePrint Archive: Report 2014/742

A survey of Fault Attacks in Pairing Based Cryptography

Nadia El Mrabet and Jacques J.A. Fournier and Louis Goubin and Ronan Lashermes

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.

Category / Keywords: public-key cryptography /

Original Publication (with minor differences): Cryptography and Communications
DOI:
10.1007/s12095-014-0114-5

Date: received 23 Sep 2014, last revised 26 Sep 2014

Contact author: nad elmrabet at gmail com

Available format(s): PDF | BibTeX Citation

Note: The article should be published at the beginning of 2015.

Version: 20140926:091929 (All versions of this report)

Short URL: ia.cr/2014/742

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]