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

Nadia El Mrabet 1
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Reports
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00323685
Contributor : Nadia El Mrabet <>
Submitted on : Monday, September 22, 2008 - 6:10:31 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM
Long-term archiving on : Friday, June 4, 2010 - 11:41:19 AM

File

DERNIER_FAUTE.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00323685, version 1

Collections

Citation

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

Share

Metrics

Record views

181

Files downloads

100