Sciweavers

IJNSEC
2011
106views more  IJNSEC 2011»
13 years 6 months ago
Elliptic Curve Cryptosystems and Side-channel Attacks
In this paper, we present a background on elliptic curve cryptosystems (ECCs) along with the different methods used to compute the scalar multiplication (ECSM), which is the core...
Ekambaram Kesavulu Reddy
IPL
2007
105views more  IPL 2007»
13 years 11 months ago
Improving the arithmetic of elliptic curves in the Jacobi model
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
Sylvain Duquesne
AMC
2006
91views more  AMC 2006»
13 years 11 months ago
Fast elliptic scalar multiplication using new double-base chain and point halving
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...
Kwok-Wo Wong, Edward C. W. Lee, L. M. Cheng, Xiaof...
ACSW
2007
14 years 27 days ago
Isogeny cordillera algorithm to obtain cryptographically good elliptic curves
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computati...
Josep M. Miret, D. Sadornil, J. Tena, R. Tomas, Ma...
FDTC
2008
Springer
160views Cryptology» more  FDTC 2008»
14 years 1 months ago
Error Detection for Borrow-Save Adders Dedicated to ECC Unit
Differential Fault Analysis (DFA) is a real threat for elliptic curve cryptosystems. This paper describes an elliptic curve cryptoprocessor unit resistant against fault injection....
Julien Francq, Jean-Baptiste Rigaud, Pascal Manet,...
ICICS
1997
Springer
14 years 3 months ago
Efficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
Atsuko Miyaji, Takatoshi Ono, Henri Cohen
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
14 years 3 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye
CHES
2004
Springer
216views Cryptology» more  CHES 2004»
14 years 3 months ago
Efficient Countermeasures against RPA, DPA, and SPA
In the execution on a smart card, side channel attacks such as simple power analysis (SPA) and the differential power analysis (DPA) have become serious threat [15]. Side channel a...
Hideyo Mamiya, Atsuko Miyaji, Hiroaki Morimoto
ASIACRYPT
1999
Springer
14 years 3 months ago
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jian...
INDOCRYPT
2004
Springer
14 years 4 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...