89 search results - page 4 / 18 » A note on the Ate pairing |
PKC
2010
Springer
13 years 11 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
DM
2006
13 years 7 months ago
2006
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
JCT
1998
13 years 7 months ago
1998
Recently, Andrews and Berkovich introduced a trinomial version of Bailey’s lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This ...
COMBINATORICS
1999
13 years 7 months ago
1999
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...