22 search results - page 2 / 5 » Construction of Rational Points on Elliptic Curves over Fini... |
FFA
2011
14 years 4 months ago
2011
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
59
Voted
JOC
2006
14 years 9 months ago
2006
Motivated by the needs of the pairing based cryptography, Miyaji, Nakabayashi and Takano have suggested a construction of so-called MNT elliptic curves with low embedding degree. ...
ANTS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
101
click to vote
ANTS
1998
Springer
15 years 1 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
PKC
2000
Springer
15 years 1 months ago
2000
Springer
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over...