Attacking Deterministic Signature Schemes using Fault Attacks Damian Poddebniak∗, Juraj Somorovskyy, Sebastian Schinzel∗, Manfred Lochterz and Paul Rosler¨ y ∗Munster¨ University of Applied Sciences
[email protected],
[email protected] yChair for Network and Data Security, Ruhr University Bochum
[email protected],
[email protected] zFederal Office for Information Security
[email protected] Abstract Many digital signature schemes rely on random numbers that are unique and non-predictable per signature. Failures of random number generators may have catastrophic effects such as com- promising private signature keys. In recent years, many widely-used cryptographic technologies adopted deterministic signature schemes because they are presumed to be safer to implement. In this paper, we analyze the security of deterministic ECDSA and EdDSA signature schemes and show that the elimination of random number generators in these schemes enables new kinds of fault attacks. We formalize these attacks and introduce practical attack scenarios against EdDSA using the Rowhammer fault attack. EdDSA is used in many widely used protocols such as TLS, SSH and IPSec, and we show that these protocols are not vulnerable to our attack. We formalize the necessary requirements of protocols using these deterministic signature schemes to be vulnerable, and discuss mitigation strategies and their effect on fault attacks against deterministic signature schemes. 1. Introduction The Digital Signature Standard (DSS) describes a family of cryptographic methods such as the Digital Signature Algorithm (DSA) for digitally signing content. The Elliptic Curve Digital Signature Algorithm (ECDSA) is a variant of DSA using elliptic curve cryptography. Both depend on a crypto- graphic random value r, which must never repeat under different messages.