190 search results - page 6 / 38 » Supersingular Elliptic Curves in Cryptography |
GMP
2003
IEEE
15 years 5 months ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
INDOCRYPT
2001
Springer
15 years 4 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...
116
click to vote
ESORICS
2004
Springer
15 years 5 months 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 ...
WAIFI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
107
Voted
CHES
2009
Springer
16 years 7 days ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...