204 search results - page 7 / 41 » Powered Tate Pairing Computation |
CARDIS
2010
Springer
14 years 5 months ago
2010
Springer
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...
RTA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
TIT
2010
13 years 5 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
STACS
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
IWSEC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Pairing-based cryptography (PBC) has enabled the construction of many cryptographic protocols. However, there are scenarios when PBC is too heavyweight to use, such as wh...