The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks

DOI10.1007/978-3-540-73489-5_12zbMath1151.94582OpenAlexW1520995829MaRDI QIDQ5429241

No author found.

Publication date: 29 November 2007

Published in: Pairing-Based Cryptography – Pairing 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73489-5_12

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (6)

Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ The random oracle model: a twenty-year retrospective ⋮ A survey of fault attacks in pairing based cryptography ⋮ Tower building technique on elliptic curve with embedding degree 18 ⋮ The Hidden Root Problem ⋮ What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?

This page was built for publication: The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks