362 search results - page 21 / 73 » Abstraction in Cryptography |
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. Our approach uses functions that estimate the distance of a group...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
CHES
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We ...