126 search results - page 4 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
INDOCRYPT
2001
Springer
13 years 11 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
ESORICS
2004
Springer
14 years 22 days ago
2004
Springer
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts ...
CHES
2004
Springer
14 years 23 days ago
2004
Springer
CRYPTOLOGIA
2007
13 years 7 months ago
2007
In this article we propose an algorithm for oblivious transfer using elliptic curves. Also, we present its application to chosen one-out-of-two oblivious transfer. Keywords Ellipti...
CHES
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...