What about Vulnerability to a Fault Attack of the Miller's Algorithm During an Identity Based Protocol?

Authors:
Nadia Mrabet
Affiliations:
LIRMM Laboratory, I3M, CNRS, University Montpellier, Montpellier, France 34 392
Venue:
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Year:
2009

Citing 14
Cited 3

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Transaction security system

IBM Systems Journal - Special issue on cryptology
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Scan Based Side Channel Attack on Dedicated Hardware Implementations of Data Encryption Standard

ITC '04 Proceedings of the International Test Conference on International Test Conference
A Fault Attack on Pairing-Based Cryptography

IEEE Transactions on Computers
Tamper resistance: a cautionary note

WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Another Approach to Pairing Computation in Edwards Coordinates

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
On the importance of checking cryptographic protocols for faults

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Fast point multiplication on elliptic curves through isogenies

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Side channel analysis of practical pairing implementations: which path is more secure?

VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
The importance of the final exponentiation in pairings when considering fault attacks

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition

Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition

Fault attacks against the miller algorithm in hessian coordinates

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Improved side channel attacks on pairing based cryptography

COSADE'13 Proceedings of the 4th international conference on Constructive Side-Channel Analysis and Secure Design
Inverting the final exponentiation of tate pairings on ordinary elliptic curves using faults

CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

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.