Abstract
Over the last ten years, the use of bilinear maps or “pairings” as building block primitives within cryptographic schemes has become commonplace. This trend has been supported by insight into their security properties and methods for efficient evaluation; the latter aspect has provided results that now allow even embedded devices to execute pairing-based schemes. However, this raises questions relating to physical security in the same way as for RSA- and ECC-based schemes. Specifically, the secure deployment of a pairing-based scheme necessitates the study of related fault attacks. This chapter attempts to survey the state of the art in this respect; it aims to describe the main results in this area, and give an overview of potential countermeasures.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
El Mrabet, N., Page, D., Vercauteren, F. (2012). Fault Attacks on Pairing-Based Cryptography. In: Joye, M., Tunstall, M. (eds) Fault Analysis in Cryptography. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29656-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-29656-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29655-0
Online ISBN: 978-3-642-29656-7
eBook Packages: Computer ScienceComputer Science (R0)