Abstract
The second example of a physical attack which has not been regarded as a realistic threat due to its physical attack complexity is a fault attack against pairing-based cryptography, in particular a higher-order fault attack.
If the adversary can inject multiple faults [...], then an attack could be launched. This however, is an unrealistic attack scenario.
(C. Whelan, M. Scott [186])
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Singapore
About this chapter
Cite this chapter
Krämer, J. (2015). Higher-Order Fault Attacks Against Pairing Computations. In: Why Cryptography Should Not Rely on Physical Attack Complexity. T-Labs Series in Telecommunication Services. Springer, Singapore. https://doi.org/10.1007/978-981-287-787-1_5
Download citation
DOI: https://doi.org/10.1007/978-981-287-787-1_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-287-786-4
Online ISBN: 978-981-287-787-1
eBook Packages: EngineeringEngineering (R0)