Sciweavers

11 search results - page 1 / 3
» A Note on Integer Factorization Using Lattices
Sort
View
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 7 months ago
A Note on Integer Factorization Using Lattices
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of [11], as well as new pro...
Antonio Ignacio Vera
LATIN
2010
Springer
14 years 2 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
14 years 17 days ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
CRV
2005
IEEE
179views Robotics» more  CRV 2005»
13 years 9 months ago
Detection of Linear and Cubic Interpolation in JPEG Compressed Images
A novel algorithm is introduced that can detect the presence of interpolation in images prior to compression as well as estimate the interpolation factor. The interpolation detect...
Andrew C. Gallagher
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan