Sciweavers

30 search results - page 3 / 6
» Primality Proving with Elliptic Curves
Sort
View
CRYPTO
2007
Springer
130views Cryptology» more  CRYPTO 2007»
13 years 12 months ago
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
Daniel R. L. Brown, Kristian Gjøsteen
INDOCRYPT
2004
Springer
13 years 11 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...
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
13 years 9 months ago
Visualizing Elements of Sha[3] in Genus 2 Jacobians
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...
Nils Bruin, Sander R. Dahmen
PKC
2004
Springer
151views Cryptology» more  PKC 2004»
13 years 11 months ago
On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny
The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny f...
Toru Akishita, Tsuyoshi Takagi
EUROCRYPT
2003
Springer
13 years 11 months ago
The GHS Attack Revisited
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
Florian Hess