53 search results - page 2 / 11 » How to Hash into Elliptic Curves |
LATINCRYPT
2010
13 years 7 months ago
2010
Let E be a non-supersingular elliptic curve over a finite field Fq. At CRYPTO 2009, Icart introduced a deterministic function Fq → E(Fq) which can be computed efficiently, and ...
ISCAS
2002
IEEE
14 years 1 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...
PAIRING
2010
Springer
13 years 7 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...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
IEICET
2008
13 years 8 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...