26 search results - page 2 / 6 » Factorization of Square-Free Integers with High Bits Known |
EUROCRYPT
2004
Springer
14 years 8 days ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
TIP
2002
13 years 6 months ago
2002
Abstract--This paper deals with the design and implementation of an image transform coding algorithm based on the integer wavelet transform (IWT). First of all, criteria are propos...
ISTCS
1995
Springer
13 years 10 months ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
ASIACRYPT
2003
Springer
14 years 3 days ago
2003
Springer
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...