110
Voted
ANTS
2006
Springer
15 years 7 months ago
2006
Springer
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...
142
click to vote
ANTS
2006
Springer
15 years 7 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
163
click to vote
ANTS
2006
Springer
15 years 7 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
131
click to vote
ATS
2004
IEEE
15 years 7 months ago
2004
IEEE
In this paper, we propose a low-power testing methodology for the scan-based BIST. A smoother is included in the test pattern generator (TPG) to reduce average power consumption d...