Results 21 to 30 of about 6,745,331 (273)
Lattice Sparsification and the Approximate Closest Vector Problem [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point enumeration techniques of Micciancio and Voulgaris (STOC 2010) and Dadush, Peikert and Vempala (FOCS 2011), and gives an
D.N. Dadush (Daniel), G. Kun (Gábor)
openaire +6 more sources
Selecting Closest Vectors Through Randomization [PDF]
, 2015 We consider the problem of finding the closest vectors to a given vector in a large set of vectors, and propose a randomized solution. The method has applications in Automatic Target Recognition (ATR), Web Information Retrieval, and Data Mining ...
Bosley, Carl, Rabin, Michael
core +4 more sources
The Furvela tent-trap Mk 1.1 for the collection of outdoor biting mosquitoes [PDF]
PeerJ, 2017 Outdoor transmission of malaria and other vector borne diseases remains a problem. The WHO has recently recognized the need for suitable methods for assessing vector density outdoors and a number of tent-traps have been developed. Only one such trap, the
Jacques D. Charlwood +3 more
doaj +2 more sources
Approximating Closest Vector Problem in ℓ∞-Norm Revisited
The Computer Journal, 2021 Abstract The security of most lattice-based cryptography schemes are based on two computational hard problems which are the short integer solution (SIS) and learning with errors (LWE) problems. The computational complexity of SIS and LWE problems are related to approximating shortest vector problem and bounded distance decoding (BDD ...
Wenbin Chen 0003, Jianer Chen
openaire +2 more sources
A Heuristic Method to Approximate the Closest Vector Problem
WSEAS TRANSACTIONS ON MATHEMATICS, 2022 The closest vector problem, or CVP for short, is a fundamental lattice problem. The purpose of this challenge is to identify a lattice point in its ambient space that is closest to a given point. This is a provably hard problem to solve, as it is an NP-hard problem.
Mustapha Elhassani +2 more
openaire +1 more source
Using Geometrical Properties for Fast Indexation of Gaussian Vector Quantizers
EURASIP Journal on Advances in Signal Processing, 2007 Vector quantization is a classical method used in mobile communications. Each sequence of d samples of the discretized vocal signal is associated to the closest d-dimensional codevector of a given set called codebook.
J. M. Steyaert +2 more
doaj +2 more sources
Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 Improving on the Voronoi cell based techniques of Micciancio and Voulgaris (SIAM J. Comp. 13), and Sommer, Feder and Shalvi (SIAM J. Disc. Math. 09), we give a Las Vegas $\tilde{O}(2^n)$ expected time and space algorithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP).
D.N. Dadush (Daniel), N. Bonifas
openaire +5 more sources
Composite Ski-Resort Registration Method Based on Laser Point Cloud Information
Machines, 2022 The environment of ski resorts is usually complex and changeable, and there are few characteristic objects in the background, which creates many difficulties for the registration of ski-resort point cloud datasets.
Wenxin Wang +2 more
doaj +1 more source
The Double-Plane Algorithm: A simple algorithm for the closest vector problem [PDF]
2018 International Symposium on Information Theory and Its Applications (ISITA), 2018 Abstract—We present a new algorithm for solving the closest vector problem. The algorithm is called the double-plane algorithm and it is an extension of Babai’s nearest plane algorithm. The algorithm is an approximative algorithm, and the performance of the algorithm depends on the quality of the lattice basis.
Greferath, Marcus, Blomqvist, Ferdinand
openaire +3 more sources
New lattice attacks on DSA schemes
Journal of Mathematical Cryptology, 2016 We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently.
Poulakis Dimitrios
doaj +1 more source