Fault attacks against the miller algorithm in hessian coordinates

Authors:
Jiang Weng;Yunqi Dou;Chuangui Ma
Affiliations:
Zhengzhou Information Science and Technology Institute, Zhengzhou, Henan Province, China;Zhengzhou Information Science and Technology Institute, Zhengzhou, Henan Province, China;Zhengzhou Information Science and Technology Institute, Zhengzhou, Henan Province, China
Venue:
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Year:
2011

Citing 10
Cited 0

Sequences of numbers generated by addition in formal groups and new primality and factorization tests

Advances in Applied Mathematics
Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The Hessian Form of an Elliptic Curve

CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
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
What about Vulnerability to a Fault Attack of the Miller's Algorithm During an Identity Based Protocol?

ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Side channel analysis of practical pairing implementations: which path is more secure?

VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
The importance of the final exponentiation in pairings when considering fault attacks

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, fault attacks have been developed to be very powerful tools in the field of attack against crypto-algorithm. The basic idea of fault attacks is through provoking disturbances, then an adversary is able to recover some secret data from a carelessly implemented crypto-algorithm. As we known the Miller's algorithm is the critical step for bilinear pairing calculation. Since the Miller's algorithm is usually embedded in identity aware devices such as smart card, a lot of attentions are attracted to analyze these devices. In this paper, we investigate a new approach based on the resolution of a nonlinear system, and this approach has an advantage that the pairing based cryptography in Hessian coordinates is vulnerable to a fault attack.