17 search results - page 1 / 4 » Massively Parallel Computation of Discrete Logarithms |
CRYPTO
1992
Springer
13 years 9 months ago
1992
Springer
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
TVCG
2012
11 years 7 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
WCE
2007
13 years 6 months ago
2007
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...