Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Closest Vector Problem"”.
-
LATTICE REDUCTION ALGORITHMS
… reduction algorithms. We discuss two latticeproblems: the shortest vector problem and the closest vector problem. Then we introducetwo types of lattice reduction algorithms: Guassian Lattice Reduction in two-dimensionsand the LLL Algortihm. We illustrate how both algorithms can provide …
-
Lattice-Based Cryptography: A Comparative Study of GGH and NTRU
… as lattice bases, lattice reduction, Shortest Vector Problem (SVP), and Closest Vector Problem (CVP) are introduced. Algorithms discussed are Gaussian's Lattice Reduction, Lenstra--Lenstra--Lovász (LLL), and Babai's algorithm for CVP. With these foundations, we demonstrate the construction, …
-
INFORMATION THEORETIC AND ALGEBRAIC TECHNIQUES IN THEORETICAL COMPUTER SCIENCE
… the running time of the algorithm for Shortest Vector Problem and Closest Vector Problem on lattices in infinity norm.
-
EXPONENTIAL TIME/SPACE ALGORITHMS AND REDUCTIONS FOR LATTICE PROBLEMS
… A lattice of rank n is defined as the set of vectors generated by integer linear combinations of n linearly independent vectors. In this thesis, our focus is on two fundamental computational problems on lattices: the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). We …
-
An investigation of some public key exchange cryptosystems
… practical attack against this protocol based on Closest Vector Problem (CVP) and Gaussian lattice reduction. An extension of Bergman's ring was introduced by Climent et al.. The new ring is called E^(m)_p. They established that only a negligible fraction of elements are invertible in it, and then …
-
Considerations on computational lattice problems
… of integer linear combinations of their basis vectors, it is possible to define NP-hard problems on them. Due to the existence of a class of lattices with favorable worst-case to average-case connection, these problems are well suited as basis for provable secure cryptosystems. The problems …
-
Μελέτη και επίλυση πολυωνυμικών συστημάτων με χρήση αλγεβρικών και συνδυαστικών μεθόδων
… of the thesis is threefold. We worked on Problems in the areas of algebraic algorithms, computational geometry and algebraic combinatorics. The first Problem is computing the discriminant, when the system’s dimension varies. Thus solving polynomial equations and systems by exploiting the …
-
Čínská věta o zbytcích a její aplikace při moderní akvizici a rekonstrukci digitálního signálu
Tato diplomová práce zkoumá aplikaci Čínské zbytkové věty (CRT) na moderní systémy sběru signálů se zvláštním zaměřením na modulové vzorkování a rekonstrukci signálů s vysokým dynamickým rozsahem. Jsou navrženy dva komplementární rekonstrukční přístupy: metoda založená na CRT pro přesnou …
-
Alternativní metody v kryptografii
… obecně kryptografie, dále je všeobecně rozebrána problematika současných šifrovacích metod. Patří mezi ně asymetrické, symetrické a hybridní šifrovací metody. Druhá část práce je zaměřena na teorii mříží a jejich hlavní matematické problémy, tedy problém nejkratšího vektoru, problém nejbližšího …