Abstract. In this paper we extend the ideas for differential fault attacks on the RSA cryptosystem (see [4]) to schemes using elliptic curves. We present three different types of attacks that can be used to derive information about the secret key if bit errors can be inserted into the elliptic curve computations in a tamper-proof device. The effectiveness of the attacks was proven in a software simulation of the described ideas.

No abstract

Abstract.We generalize and improve t h e schemes of [4]. We introduce analogues of exponentiation and cliscrele logarithms in the principle cycle of real quadratic orders. This enables us t o implement many cryptographic protocols based on discrete logarithms, e.g. a variant of t h e signature scheme of ElGamal [S].

No abstract

No abstract