A survey of fault attacks in pairing based cryptography
From MaRDI portal
(Redirected from Publication:892296)
Recommendations
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 5493294 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- A Fault Attack on Pairing-Based Cryptography
- A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Elliptic Curve Cryptography
- Differential power and electromagnetic attacks on a FPGA implementation of elliptic curve cryptosystems
- Efficient implementation of bilinear pairings on ARM processors
- Efficient pairing computation on supersingular abelian varieties
- Efficient pairing computation with theta functions
- FPGA implementation of pairings using residue number system and lazy reduction
- Fault attacks against the miller algorithm in Hessian coordinates
- Fault attacks on pairing-based cryptography
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Identity-Based Encryption from the Weil Pairing
- Identity-based cryptosystems and signature schemes
- Inverting the final exponentiation of Tate pairings on ordinary elliptic curves using faults
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- On the efficient implementation of pairing-based protocols
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Optimal Pairings
- Pairing Lattices
- Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
- Side channel analysis of practical pairing implementations: which path is more secure?
- Side channel attacks against pairing over theta functions
- The Arithmetic of Elliptic Curves
- The Eta Pairing Revisited
- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
- The Weil pairing, and its efficient calculation
- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
Cited in
(12)- Weaknesses of the Tate pairing on generalized Hessian curves
- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
- Side channel analysis of practical pairing implementations: which path is more secure?
- Implementation attacks \& countermeasures
- Robust finite field arithmetic for fault-tolerant Tate pairing
- Fault attacks on pairing-based cryptography
- New versions of Miller-loop secured against side-channel attacks
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- Still wrong use of pairings in cryptography
- A Fault Attack on Pairing-Based Cryptography
- Fault attacks against the miller algorithm in Hessian coordinates
- Inverting the final exponentiation of Tate pairings on ordinary elliptic curves using faults
This page was built for publication: A survey of fault attacks in pairing based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892296)