Abstract : We complete the study of [16] and [20] about the Miller's algorithm. The Miller's 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's algorithm when it undergoes a fault attack. We prove that the Miller's 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.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00387057
Contributor : Nadia El Mrabet
<>
Submitted on : Friday, May 22, 2009 - 7:18:35 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM
Long-term archiving on : Thursday, June 10, 2010 - 11:44:08 PM
Nadia El Mrabet. What about Vulnerability to a Fault Attack of the Miller Algorithm during an Identity Based Protocol?. ISA'09: The 3rd International Conference on Information and Assurance, Jun 2009, Séoul, South Korea. pp.122-134. ⟨lirmm-00387057⟩
