Paper 2011/709 Original: eprint.iacr.org/2011/709 ↗
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].
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2011-12-31: last updated
- 2011-12-31: published
- Short URL
- https://ia.cr/2011/709
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/709,
author = {Nadia El Mrabet},
title = {Fault Attack against Miller's algorithm},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/709},
year = {2011},
url = {https://eprint.iacr.org/2011/709}
}