190 search results - page 4 / 38 » Supersingular Elliptic Curves in Cryptography |
EUROCRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
PAIRING
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hy...
MYCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
109
click to vote
PAIRING
2007
Springer
15 years 5 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
110
click to vote
ISCAS
2002
IEEE
15 years 4 months ago
2002
IEEE
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studi...