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 8 of 8 for “"LLL algorithm"”.
-
A Hybrid Method for Lattice Basis Reduction and Applications
… Efficient and robust lattice basis reduction algorithms are valuable. In this thesis, we present an O(n^4 logB) hybrid Jacobi method for lattice basis reduction, where n is the dimension of the lattice and B is the maximum length of the input lattice basis vectors. Building upon a generic …
-
Lagrangian Representations of (p, p, p)-triangle Groups
… the exact generators by a process utilizing the LLL algorithm. The matrices are proved rigorously to generate Lagrangian representations of the (p, p, p)-triangle group and are applied to the problem of deciding whether or not an interval contains representations of the (p, p, p)-triangle group …
-
Efficient LLL-based lattice reduction for MIMO detection: From algorithms to implementations
Lenstra-Lenstra-Lovasz (LLL) algorithm has been adopted as a lattice reduction (LR) technique for multiple-input multiple-output (MIMO) systems in wireless communications to improve performance with low complexity. Recently, some enhanced LLL variants are proposed, such as greedy LLL algorithms …
-
GGH Cryptosystem and Lattice Reduction Algorithms
… for general cases. A lattice basis reduction algorithm is applied to the public key to get a better basis, which is used to decrypt the ciphertext. In the proposed approach, we concentrate on three lattice reduction algorithms: the LLL algorithm, the approximate optimally-reduced algorithm, …
-
LATTICE REDUCTION ALGORITHMS
… of this thesis is to propose and analyze an algorithm that followssimilar steps of Guassian Lattice Reduction Algorithm in two-dimensions and applyingthem to three-dimensions. We start off by discussing the importance of cryptography inour day to day lives. Then we dive into some linear …
-
Wireless receiver designs: from information theory to VLSI implementation
… communications, the Lenstra-Lenstra-Lovasz (LLL) algorithm [51] and Seysen's algorithm (SA), by providing detailed descriptions and pseudo codes. The properties of output matrices of the LLL algorithm and SA are also quantified. Furthermore, other LR algorithms are also briefly introduced. …
-
Solving Hard Graph Problems with Combinatorial Computing and Optimization
… hierarchy, it is unlikely that efficient, exact algorithms will solve them. Therefore, alternative computational methods are used. Combinatorial computing is a branch of mathematics and computer science concerned with these methods, where algorithms are developed to generate and search through …
-
Lattice-Based Precoding And Decoding in MIMO Fading Systems
… that the lattice-reduction-aided method, using LLL algorithm, achieves the optimum asymptotic slope of symbol-error-rate (called the precoding diversity). 2) Lattice-based decoding in MIMO multiaccess systems and MIMO point-to-point systems: Diversity order and diversity-multiplexing tradeoff …