Sciweavers

237 search results - page 27 / 48
» MapReduce for Integer Factorization
Sort
View
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
14 years 2 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
JSW
2008
101views more  JSW 2008»
13 years 11 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza
JUCS
2006
137views more  JUCS 2006»
13 years 11 months ago
Progress in Quantum Computational Cryptography
: Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. ...
Akinori Kawachi, Takeshi Koshiba
JCSS
2007
88views more  JCSS 2007»
13 years 10 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 10 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram