4212 search results - page 59 / 843 » On Compressible Pairings and Their Computation |
139
Voted
ASIACRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the...
132
click to vote
CRIWG
2004
15 years 2 months ago
2004
Pair programming is an Extreme Programming (XP) practice where two programmers work on a single computer to produce an artifact. Empirical evaluations have provided evidence that t...
104
click to vote
ISESE
2003
IEEE
15 years 5 months ago
2003
IEEE
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, code, or test. Pair programming is becoming increasingl...
79
Voted
DATE
2006
IEEE
15 years 6 months ago
2006
IEEE
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...
116
Voted
CHES
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...