Sciweavers

27 search results - page 5 / 6
» Recent progress on the elliptic curve discrete logarithm pro...
Sort
View
EUROCRYPT
2001
Springer
13 years 10 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
IJNSEC
2006
98views more  IJNSEC 2006»
13 years 6 months ago
Comment on Improvement of the Miyazaki-Takaragi Threshold Digital Signature Scheme
To enhance applications of smart cards, Miyazaki and Takaragi proposed a (t, n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm (ECDL...
Zuhua Shao
SCN
2004
Springer
123views Communications» more  SCN 2004»
13 years 11 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
13 years 10 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
MOC
2002
84views more  MOC 2002»
13 years 6 months ago
Smooth ideals in hyperelliptic function fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
Andreas Enge, Andreas Stein