Shortest Vector Problem
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
... the Shortest Vector Problem (SVP) and the Closest Vector Problem ...a shortest nonzero vector in the lattice. The problem CVP is an inhomogeneous variant of SVP, in ...
19
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem
... the shortest nonzero vec- tor in an n-dimensional lattice depends on a parameter ...lattice vector whose length is greater than the length of a shortest nonzero vector in the lattice by at ...
31
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
... the shortest vector problem for lattices is a fundamen- tal assumption underpinning the security of many lattice-based cryptosystems, and therefore, it is important to evaluate its ...to ...
23
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction
... the problem is hard even in its approximate ...lattice vector v ∈ Λ is close to the target t, then t − v is a short vector in the lattice generated by Λ and ...Distance Problem (MDP) on linear ...
26
On the Relationship Between Two Embeddings of Ideals into Geometric Space and the Shortest Vector Problem in Principal Ideal Lattices.
... short vector output of the LLL on this particular ...short vector output and a principal ideal’s ...short vector output and a generator of the principal ideal is left for future ...
131
Solving closest vector instances using an approximate shortest independent vectors oracle
... Lattices are discrete subgroups of R n . They are powerful mathematical objects that have been used to efficiently solve many important problems in computer science, most notably in the areas of cryptography and ...
11
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems
... In the previous subsections we focused on 2-dimensional reduction: Gauss’ algorithm, for finding optimal 2-dimensional bases, and the blockwise LLL algorithm, for finding bases in high dimensions that are locally almost ...
43
Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search
... exact shortest vector problem (SVP) which runs in time 2 ...search problem: Given a list of exponentially many unit vectors of R m , and an angle γπ, find all pairs of vectors whose angle ≤ ...
14
DA-Encrypt: Homomorphic Encryption via Non-Archimedean Diophantine Approximation --- Preliminary Report
... the shortest vector problem in principal ideal lattice may be solvable with a quantum computer, and that the shortest vector problem in certain types of principal ideal lattices ...
22
A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors
... Abstract. In this paper, we propose a new phase-based enumeration algorithm based on two interesting and useful observations for y-sparse representations of short lattice vectors in lattices from SVP challenge ...
10
A Genetic Algorithm for Searching Shortest Lattice Vector of SVP Challenge
... as Shortest Vector Problem (SVP) is concerned, it is a difficult task to encode a lattice vector into a chromesome for genetic algorithms to handle smoothly, which has not yet been researched ...
17
On Some Computational Problems in Local Fields
... Lattices in Euclidean spaces are important research objects in geometric number theory, and they have important applications in many areas, such as cryptology. The shortest vector problem (SVP) and ...
11
Optimizing Cost-Effective Travel Modes between Two Destinations Using Dijkstra Approach
... transportation problem, critical path, shortest path, minimum cost flow problems, and many ...the shortest path from UiTM Perlis to Johor Bahru (JB) with the least time and ...
6
Symmetric strong vector quasiequilibrium problems in Hausdorff locally convex spaces
... Equilibrium problem was introduced by Blum and Oettli [1] (see, also Noor and Oettli ...of vector equilibrium ...for vector equilibrium problems and vector variational inequalities have been ...
13
On a New Notation of Fuzzy Subgroup
... 3. M. K. Luhandjula, "Fuzzy optimization: milestones and perspectives," Fuzzy Sets and Systems, vol. 274, pp. 4-11, 2015. 4. S. Broumi, A. Dey, M. Talea, A. Bakali, F. Smarandac -he, D. Nagarajan, M. ...
6
Distance-Vector Algorithms for Distributed Shortest Paths on Dynamic Power-Law Networks
... In this paper, we first survey the main features of some of the most established solutions of the Distance-Vector category, namely DBF, DUAL, and LFR. Then, we summarize the main characteristics of DCP. Finally, ...
25
A Novel Approach of the Shortest Path Problem Using P System
... Abstract: Membrane Computing is inspired from biological cell activities as a new distributed parallel computational framework, which can be used for decreasing the time complexity of problems with high execution time. ...
11
Comprehensive Study on Computational Methods for K Shortest Paths Problem
... This review is carried out to explore the basic types of the algorithms available for computing loop less K-shortest paths between a pair of nodes in a network and to reflect their computational procedure and ...
5
Particle Swarm Optimization Algorithm for the Shortest Confidence Interval Problem
... The shortest confidence interval problem is a non-linear programming problem and the particle swarm algorithm for this problem is presented to solve ...the shortest confidence interval ...
8
ON THE GENERALIZED VECTOR EQUILIBRIUM PROBLEM
... In this paper, we introduced a new concept of bounded radius rotation to define the class of q-starlike functions of order α using the q-derivative, some geometric properties of linear c[r] ...
7