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 5 of 5 for “"The LLL Algorithm"”.
-
Lagrangian Representations of (p, p, p)-triangle Groups
… formulae for Lagrangian representations of the (p, q, r)-triangle group into the group of direct isometries of the complex hyperbolic plane in the case where p=q=r. Numerically approximated matrix generators of representations of the (p, p, p)-triangle group are obtained using a special …
-
GGH Cryptosystem and Lattice Reduction Algorithms
<p>The capability of encrypting top secret information remains as a major research problem in the GGH cryptosystem, which depends on various attacking methods. The early approaches to attacking the GGH cryptosystem mainly relied on special properties of the lattice generated by the vectors of the …
-
LATTICE REDUCTION ALGORITHMS
The purpose 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 …
-
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 …
-
Wireless receiver designs: from information theory to VLSI implementation
… academia and industry. It is a problem with both theoretical challenges and severe implementation hurdles. While much research has been focused on reducing complexity for optimal or near-optimal schemes, it is still common practice in industry to use simple techniques (such as linear equalization) …