Sciweavers

IWSEC
2010
Springer
13 years 1 months ago
Differential Addition in Generalized Edwards Coordinates
We use two parametrizations of points on elliptic curves in generalized Edwards form x2 + y2 = c2 (1 + dx2 y2 ) that omit the xcoordinate. The first parametrization leads to a diff...
Benjamin Justus, Daniel Loebenberger
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
13 years 1 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...
MOC
2002
60views more  MOC 2002»
13 years 3 months ago
The Igusa local zeta functions of elliptic curves
Abstract. We determine the explicit form of the Igusa local zeta function associated to an elliptic curve. The denominator is known to be trivial. Here we determine the possible nu...
Diane Meuser, Margaret Robinson
JAL
1998
74views more  JAL 1998»
13 years 3 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 3 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
IPL
2007
105views more  IPL 2007»
13 years 3 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
TC
2008
13 years 3 months ago
Cryptanalysis with COPACOBANA
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
Tim Güneysu, Timo Kasper, Martin Novotn&yacut...
IJNSEC
2007
130views more  IJNSEC 2007»
13 years 3 months ago
An Attack on Libert et al.' s ID-based Undeniable Signature Scheme
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
Zichen Li, C. F. Chong, Lucas Chi Kwong Hui, Siu-M...
IJISEC
2008
108views more  IJISEC 2008»
13 years 3 months ago
A note on the Ate pairing
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...
Changan Zhao, Fangguo Zhang, Jiwu Huang
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 3 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...