Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
From MaRDI portal
Publication:2947089
DOI10.1007/978-3-319-18681-8_21zbMath1441.94077OpenAlexW2182718385MaRDI QIDQ2947089
Emmanuel Fouotsa, Nadia El Mrabet
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18681-8_21
Related Items (2)
Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ New versions of Miller-loop secured against side-channel attacks
Cites Work
- Unnamed Item
- Unnamed Item
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Fault Attacks on Pairing-Based Cryptography
- Inverting the Final Exponentiation of Tate Pairings on Ordinary Elliptic Curves Using Faults
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- A Fault Attack on Pairing-Based Cryptography
- The Eta Pairing Revisited
- Pairing Lattices
- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
- Identity-Based Encryption from the Weil Pairing
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
- Topics in Cryptology – CT-RSA 2005
- Cryptography and Coding
This page was built for publication: Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
