4377 search results - page 350 / 876 » Mass problems and randomness |
215
click to vote
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
166
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
177
click to vote
EUROPAR
1997
Springer
15 years 11 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
124
click to vote
SIGCOMM
1993
ACM
15 years 11 months ago
1993
ACM
The paper considers a network with many apparently-independent periodic processes and discusses one method by which these processes can inadvertently become synchronized. In parti...
187
click to vote
CHES
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we present a new attack on RSA when the public exponent is short, for instance 3 or 216 +1, and when the classical exponent randomization is used. This attack works ...