Results 1  10
of
223
Invalidcurve attacks on hyperelliptic curve cryptosystems’, Adv
 Math. of Comm
"... Abstract. We extend the notion of an invalidcurve attack from elliptic curves to genus 2 hyperelliptic curves. We also show that invalid singular (hyper)elliptic curves can be used in mounting invalidcurve attacks on (hyper)elliptic curve cryptosystems, and make quantitative estimates of the prac ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We extend the notion of an invalidcurve attack from elliptic curves to genus 2 hyperelliptic curves. We also show that invalid singular (hyper)elliptic curves can be used in mounting invalidcurve attacks on (hyper)elliptic curve cryptosystems, and make quantitative estimates
Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
, 1999
"... Differential Power Analysis, first introduced by Kocher et al. in [14], is a powerful technique allowing to recover secret smart card information by monitoring power signals. In [14] a specific DPA attack against smartcards running the DES algorithm was described. As few as 1000 encryptions were su ..."
Abstract

Cited by 250 (2 self)
 Add to MetaCart
sufficient to recover the secret key. In this paper we generalize DPA attack to elliptic curve (EC) cryptosystems and describe a DPA on EC DiffieHellman key exchange and EC ElGamal type encryption. Those attacks enable to recover the private key stored inside the smartcard. Moreover, we suggest
Practical Invalid Curve Attacks on TLSECDH?
"... Abstract. Elliptic Curve Cryptography (ECC) is based on cyclic groups, where group elements are represented as points in a finite plane. All ECC cryptosystems implicitly assume that only valid group elements will be processed by the different cryptographic algorithms. It is wellknown that a check ..."
Abstract
 Add to MetaCart
Abstract. Elliptic Curve Cryptography (ECC) is based on cyclic groups, where group elements are represented as points in a finite plane. All ECC cryptosystems implicitly assume that only valid group elements will be processed by the different cryptographic algorithms. It is wellknown that a check
Faster Attacks on Elliptic Curve Cryptosystems
 Selected Areas in Cryptography, LNCS 1556
, 1998
"... The previously best attack known on elliptic curve cryptosystems used in practice was the parallel collision search based on Pollard's aemethod. The complexity of this attack is the square root of the prime order of the generating point used. For arbitrary curves, typically defined over GF (p) ..."
Abstract

Cited by 78 (1 self)
 Add to MetaCart
The previously best attack known on elliptic curve cryptosystems used in practice was the parallel collision search based on Pollard's aemethod. The complexity of this attack is the square root of the prime order of the generating point used. For arbitrary curves, typically defined over GF (p
Differential Fault Attacks on Elliptic Curve Cryptosystems
, 2000
"... 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 ..."
Abstract

Cited by 63 (0 self)
 Add to MetaCart
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
Kleptographic Attacks on Elliptic Curve Cryptosystems
 International Journal of Computer Science and Network Security
, 2010
"... Summary This paper presents an approach to mount secretly embedded trapdoor with universal protection (SETUP) attacks on elliptic curve cryptosystems. The attacked cryptosystem used is the elliptic curve analog of ElGamal encryption. The attacker can obtain the user's confidential message cove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary This paper presents an approach to mount secretly embedded trapdoor with universal protection (SETUP) attacks on elliptic curve cryptosystems. The attacked cryptosystem used is the elliptic curve analog of ElGamal encryption. The attacker can obtain the user's confidential message
Sign Change Fault Attacks on Elliptic Curve Cryptosystems
 Fault Diagnosis and Tolerance in Cryptography 2006 (FDTC ’06), volume 4236 of Lecture Notes in Computer Science
, 2004
"... We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit di#erent number representations as they are often employed in modern cryptographic applications. Previously, fault attacks on elliptic curves aimed to force a device to out ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit di#erent number representations as they are often employed in modern cryptographic applications. Previously, fault attacks on elliptic curves aimed to force a device
ZeroValue Point Attacks on Elliptic Curve Cryptosystem
 Information Security  ISC 2003, LNCS 2851
"... Abstract. Several experimental results ensure that the differential power analysis (DPA) breaks the implementation of elliptic curve cryptosystem (ECC) on memory constraint devices. In order to resist the DPA, the parameters of the underlying curve must be randomized. We usually randomize the base p ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
Abstract. Several experimental results ensure that the differential power analysis (DPA) breaks the implementation of elliptic curve cryptosystem (ECC) on memory constraint devices. In order to resist the DPA, the parameters of the underlying curve must be randomized. We usually randomize the base
Attack Cryptosystems Based on HCDLP
, 2011
"... We present an algorithm for solving the discrete logarithm problem on hyperelliptic curves defined over finite field when the cyclic group can be represented by special form. On the general case, we design a method to attack on hyperelliptic curve cryptosystems. As an example, we illustrate an attac ..."
Abstract
 Add to MetaCart
We present an algorithm for solving the discrete logarithm problem on hyperelliptic curves defined over finite field when the cyclic group can be represented by special form. On the general case, we design a method to attack on hyperelliptic curve cryptosystems. As an example, we illustrate
Exceptional procedure attack on elliptic curve cryptosystems
 PKC 2003, LNCS
, 2003
"... Abstract. The scalar multiplication of elliptic curve based cryptosystems (ECC) is computed by repeatedly calling the addition formula that calculates the elliptic curve addition of two points. The addition formula involves several exceptional procedures so that implementers have to carefully consid ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. The scalar multiplication of elliptic curve based cryptosystems (ECC) is computed by repeatedly calling the addition formula that calculates the elliptic curve addition of two points. The addition formula involves several exceptional procedures so that implementers have to carefully
Results 1  10
of
223