What about vulnerability to a fault attack of the Miller algorithm during an Identity Based Protocol ? - Archive ouverte HAL Access content directly
Reports Year : 2008

What about vulnerability to a fault attack of the Miller algorithm during an Identity Based Protocol ?

(1)
1
Nadia El Mrabet

Abstract

We complete the study of [16] and [20] about the Miller algorithm. The Miller algorithm is a central step to compute the Weil, Tate and Ate pairings. The aim of this article is to analyse the weakness of the Miller algorithm when it undergoes a fault attack. We prove that the Miller algorithm is vulnerable to a fault attack which is valid in all coordinate systems, through the resolution of a nonlinear system. We show that the final exponentiation is no longer a counter measure to this attack for the Tate and Ate pairings.
Fichier principal
Vignette du fichier
DERNIER_FAUTE.pdf (227.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00323685 , version 1 (22-09-2008)

Identifiers

  • HAL Id : lirmm-00323685 , version 1

Cite

Nadia El Mrabet. What about vulnerability to a fault attack of the Miller algorithm during an Identity Based Protocol ?. RR-08022, 2008. ⟨lirmm-00323685⟩
79 View
87 Download

Share

Gmail Facebook Twitter LinkedIn More