Fault Attack against Miller's algorithm

Abstract : We complete the study of [23] and [27] about Miller's algorithm. Miller's algorithm is a central step to compute the Weil, Tate and Ate pairings. The aim of this article is to analyze the weakness of Miller's algorithm when it undergoes a fault attack. We prove that Miller's algorithm is vulnerable to a fault attack which is valid in all coordinate systems, through the resolution of a nonlinear system. We highlight the fact that putting the secret as the rst argument of the pairing is not a countermeasure. This article is an extensed version of the article [15].
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00655465
Contributor : Nadia El Mrabet <>
Submitted on : Thursday, December 29, 2011 - 12:26:06 PM
Last modification on : Tuesday, May 22, 2018 - 8:40:06 PM
Long-term archiving on : Monday, December 5, 2016 - 9:40:35 AM

File

VersionAttackFaultEprint.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00655465, version 1

Collections

Citation

Nadia El Mrabet. Fault Attack against Miller's algorithm. 2010. ⟨hal-00655465⟩

Share

Metrics

Record views

171

Files downloads

105