190 search results - page 2 / 38 » Supersingular Elliptic Curves in Cryptography |
90
Voted
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
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 ...
89
Voted
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
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...
IEICET
2006
14 years 9 months ago
2006
This paper proposes candidate one-way functions constructed with a certain type of endomorphisms on non-supersingular elliptic curves and presents several pieces of evidence of the...
AICCSA
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and seri...
80
Voted
CANS
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tat...