1449 search results - page 116 / 290 » Self-Randomized Exponentiation Algorithms |
176
click to vote
CHES
2009
Springer
16 years 6 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...
175
click to vote
EUC
2005
Springer
15 years 12 months ago
2005
Springer
Public-key cryptosystem (PKC) is one of inevitable key technologies in order to accomplish fruitful security applications in ubiquitous computing systems. The ubiquitous computer o...
147
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
154
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
211
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The mean shift algorithm, which is a nonparametric density
estimator for detecting the modes of a distribution on a
Euclidean space, was recently extended to operate on analytic
...