Results 1  10
of
46,484
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
be randomized by the above randomization. Indeed on elliptic curves over prime fields, we have found several points P = (x, y) which cause the zerovalue registers, e.g., (1)3x 2 + a = 0, (2)5x 4 + 2ax 2 − 4bx + a 2 = 0, (3)P is ycoordinate selfcollision point, etc. We demonstrate the standard curves
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
Curves for the Elliptic Curves Cryptosystem
"... We use two methods to search for curves for the elliptic curve cryptosystem. The first method involves the definition of an elliptic curve over a number field and its reduction modulo prime ideals. The second method defines an elliptic curve over a small finite field and then considers it over exten ..."
Abstract
 Add to MetaCart
We use two methods to search for curves for the elliptic curve cryptosystem. The first method involves the definition of an elliptic curve over a number field and its reduction modulo prime ideals. The second method defines an elliptic curve over a small finite field and then considers it over
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
Fault Sensitivity Analysis Meets ZeroValue Attack
"... Abstract—Previous works have shown that the combinatorial path delay of a cryptographic function, e.g., the AES Sbox, depends on its input value. Since the relation between critical path delay and input value seems to be relatively random and highly dependent on the routing of the circuit, up to no ..."
Abstract
 Add to MetaCart
to now only template or some collision attacks could reliably extract the used secret key of implementations not protected against fault attacks. Here we present a new attack which is based on the fact that, because of the zerotozero mapping of the AES Sbox inversion circuit, the critical path when
An Analysis of ZVPAttack on ECC Cryptosystems
"... Abstract Elliptic curve cryptography (ECC) is an efficient public cryptosystem with a short key size. For this reason it is suitable for implementing on memoryconstraint devices such as smart cards, mobile devices, etc. However, these devices leak information about their private key through side ch ..."
Abstract
 Add to MetaCart
channels (power consumption, electromagnetic radiation, timing etc) during cryptographic processing. In this paper we have examined countermeasures against a specific class of side channel attacks (power analysis) called ZeroValue Point Attack (ZVP), using elliptic curve isomorphism and isogeny. We found
Electromagnetic analysis attack on an FPGA implementation of an elliptic curve cryptosystem
 In EUROCON: Proceedings of the International Conference on “Computer as a tool
, 2005
"... Abstract — This paper presents simple (SEMA) and differential (DEMA) electromagnetic analysis attacks on an FPGA implementation of an elliptic curve processor. Elliptic curve cryptography is a public key cryptosystem that is becoming increasingly popular. Implementations of cryptographic algorithms ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Abstract — This paper presents simple (SEMA) and differential (DEMA) electromagnetic analysis attacks on an FPGA implementation of an elliptic curve processor. Elliptic curve cryptography is a public key cryptosystem that is becoming increasingly popular. Implementations of cryptographic algorithms
on the security of elliptic curve cryptosystems against attacks with specialpurpose hardware
 In ”Specialpurpose Hardware for Attacking Cryptographic Systems — SHARCS’06
"... Since their invention in the mid 1980s, Elliptic Curve Cryptosystems (ECC) have become an alternative to common PublicKey (PK) cryptosystems such as, e.g., RSA. The utilization of Elliptic Curves (EC) in cryptography is very promising because of their resistance against powerful indexcalculus atta ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
result, we consider ECC over over prime fields to be far more secure than commonly believed. We show that the security of ECC163 against hardware attacks is several orders of magnitude harder than that of RSA1024. As a consequence, currently used elliptic curve cryptosystems are infeasible to break
On the optimal parameter choice for elliptic curve cryptosystems using isogeny
 Public Key Cryptography – PKC 2004, Lecture Notes in Computer Science
"... Abstract. The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny for resisting the refined differential power analysis by Goubin (Goubin’s attack). In this paper, we examine th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
the countermeasure using isogeny against zerovalue point (ZVP) attack that is generalization of Goubin’s attack. We show that some curves require higher order of isogeny to prevent ZVP attack. Moreover, we prove that this countermeasure cannot transfer a class of curve to the efficient curve that is secure against
Countermeasures against SideChannel Attacks for Elliptic Curve Cryptosystems
, 2001
"... In recent years, some attacks on cryptographic systems have been deviced, exploiting the leakage of information through socalled "side channels". When a reallife device is performing a coding or decoding procedure, one can measure quantities such as the time employed, the prole of power ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In recent years, some attacks on cryptographic systems have been deviced, exploiting the leakage of information through socalled "side channels". When a reallife device is performing a coding or decoding procedure, one can measure quantities such as the time employed, the prole of power
Results 1  10
of
46,484