Sciweavers

CALC
2001
Springer
161views Cryptology» more  CALC 2001»
13 years 10 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
13 years 10 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
13 years 10 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
CALC
2001
Springer
201views Cryptology» more  CALC 2001»
13 years 10 months ago
Finding Small Solutions to Small Degree Polynomials
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...
Don Coppersmith