Lattice-Based Fault Attacks Against ECMQV
From MaRDI portal
Publication:3297553
DOI10.1007/978-3-319-89641-0_6zbMath1450.94027OpenAlexW2797910958MaRDI QIDQ3297553
Limin Fan, Weiqiong Cao, Wenling Wu, Jingyi Feng, Hua Chen
Publication date: 20 July 2020
Published in: Constructive Side-Channel Analysis and Secure Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89641-0_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved authenticated multiple-key agreement protocol
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001
- An efficient protocol for authenticated key agreement
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- Common Points on Elliptic Curves: The Achilles’ Heel of Fault Attack Countermeasures
- To Infinity and Beyond: Combined Attack on ECC Using Points of Low Order
- Analysis of the Insecurity of ECMQV with Partially Known Nonces
- Validation of Elliptic Curve Public Keys
- Bit-Flip Faults on Elliptic Curve Base Fields, Revisited
- Another look at HMQV
- On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols
This page was built for publication: Lattice-Based Fault Attacks Against ECMQV
