Sciweavers

209 search results - page 1 / 42
» Supersingular Curves in Cryptography
Sort
View
ASIACRYPT
2001
Springer
13 years 9 months ago
Supersingular Curves in Cryptography
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
Steven D. Galbraith
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
13 years 10 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
ASIACRYPT
2001
Springer
13 years 8 months ago
Self-Blindable Credential Certificates from the Weil Pairing
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
Eric R. Verheul
DCC
2007
IEEE
14 years 4 months ago
Efficient pairing computation on supersingular Abelian varieties
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
Paulo S. L. M. Barreto, Steven D. Galbraith, Colm ...