9997 search results - page 262 / 2000 » The case for crowd computing |
166
click to vote
SACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
179
click to vote
HCI
2007
15 years 8 months ago
2007
We survey recent research in which the impact of an embodied conversational agent on human-computer interaction has been assessed through a human evaluation. In some cases, the eva...
149
click to vote
IEICET
2008
15 years 6 months ago
2008
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...
146
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
164
click to vote
MICS
2010
15 years 5 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...