53 search results - page 4 / 11 » How to Hash into Elliptic Curves |
EUROCRYPT
1999
Springer
14 years 25 days ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
DCC
2003
IEEE
14 years 8 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
ANTS
2010
Springer
14 years 14 days ago
2010
Springer
![Visualizing Elements of Sha[3] in Genus 2 Jacobians](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Visualizing Elements of Sha[3] in Genus 2 Jacobians")
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...
CARDIS
2000
Springer
14 years 27 days ago
2000
Springer
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
AFRICACRYPT
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. This paper introduces “twisted Edwards curves,” a generalization of the recently introduced Edwards curves; shows that twisted Edwards curves include more curves over...