A survey of fault attacks in pairing based cryptography
From MaRDI portal
Publication:892296
DOI10.1007/S12095-014-0114-5zbMATH Open1327.14128OpenAlexW2090996014MaRDI QIDQ892296FDOQ892296
Authors: Nadia El Mrabet, Jacques J. A. Fournier, Louis Goubin, Ronan Lashermes
Publication date: 18 November 2015
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-014-0114-5
Recommendations
Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Title not available (Why is that?)
- A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
- Identity-based cryptosystems and signature schemes
- The Arithmetic of Elliptic Curves
- Identity-Based Encryption from the Weil Pairing
- Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
- Efficient pairing computation with theta functions
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- Title not available (Why is that?)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- The Eta Pairing Revisited
- Pairing Lattices
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Advances in Elliptic Curve Cryptography
- Advances in Cryptology - ASIACRYPT 2003
- Fault attacks on pairing-based cryptography
- A Fault Attack on Pairing-Based Cryptography
- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
- Differential power and electromagnetic attacks on a FPGA implementation of elliptic curve cryptosystems
- Side channel attacks against pairing over theta functions
- Inverting the final exponentiation of Tate pairings on ordinary elliptic curves using faults
- Side channel analysis of practical pairing implementations: which path is more secure?
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- On the efficient implementation of pairing-based protocols
- FPGA implementation of pairings using residue number system and lazy reduction
- Efficient implementation of bilinear pairings on ARM processors
- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
- Fault attacks against the miller algorithm in Hessian coordinates
- Title not available (Why is that?)
Cited In (12)
- Fault attacks on pairing-based cryptography
- Still wrong use of pairings in cryptography
- New versions of Miller-loop secured against side-channel attacks
- Robust finite field arithmetic for fault-tolerant Tate pairing
- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
- A Fault Attack on Pairing-Based Cryptography
- Weaknesses of the Tate pairing on generalized Hessian curves
- Implementation attacks \& countermeasures
- Failure of the Point Blinding Countermeasure Against Fault Attack in 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
- Side channel analysis of practical pairing implementations: which path is more secure?
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)