190 search results - page 5 / 38 » Supersingular Elliptic Curves in Cryptography |
104
click to vote
EUROCRYPT
2009
Springer
16 years 8 days ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
102
click to vote
IPL
2007
14 years 11 months ago
2007
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
IJNSEC
2010
14 years 6 months ago
2010
Pseudo-random subsets of the set {1, 2, . . . , N} have many applications in the fields of network security, cryptography and other security issues. Recently, Dartyge and S
102
click to vote
PAIRING
2010
Springer
14 years 9 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
123
click to vote
CRYPTO
1991
Springer
15 years 3 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...