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 20 of 34 for “"Lattice Reduction"”.

  1. LATTICE REDUCTION ALGORITHMS

    … 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 algebra and discuss specific topics thatwill later …

    csusb Repository record for LATTICE REDUCTION ALGORITHMS (opens in a new tab)

  2. Adaptive Lattice Reduction in MIMO Systems

    … multiple-output (MIMO) systems, the use of lattice reduction methods such as the one proposed by Lenstra-Lenstra-Lovasz (LLL) significantly improves the performance of the suboptimal solutions like zero-forcing (ZF) and zero-forcing deceision-feedback-equalizer (ZF-DFE). Today's high rate …

    waterloo Repository record for Adaptive Lattice Reduction in MIMO Systems (opens in a new tab)

  3. Active Network Synthesis by Lattice Reduction

    Made available in DSpace on 2014-12-04T21:03:09Z (GMT). No. of bitstreams: 1 5904577.pdf: 2765333 bytes, checksum: 31d983671a4559b5c008405cd8ab66b1 (MD5) Previous issue date: 1959

    uiuc Repository record for Active Network Synthesis by Lattice Reduction (opens in a new tab)

  4. GGH Cryptosystem and Lattice Reduction Algorithms

    … mainly relied on special properties of the lattice generated by the vectors of the private key. Consequently, those attacks are not appropriate for general cases.</p> <p>This thesis presents a GGH attacking method for general cases. A lattice basis reduction algorithm is applied to the …

    mcmaster Repository record for GGH Cryptosystem and Lattice Reduction Algorithms (opens in a new tab)

  5. New Results on Lattice Reduction Algorithms using Deep Insertions

    A lattice is generated by integer linear combinations of a finite set of linearly independent vectors constituting a basis. A lattice reduction algorithm takes as input a bad basis and provides as output a reduced basis with shorter and more orthogonal vectors. Lattice reduction has many …

    kent Download PDF for New Results on Lattice Reduction Algorithms using Deep Insertions (opens in a new tab)

  6. Lattice reduction for MIMO detection: from theoretical analysis to hardware realization

    … aspects of symbol detection that is enhanced by lattice reduction (LR) preprocessing for wireless MIMO communication systems. The motivation for this work stems from the need to improve the bit-error-rate performance of conventional, low-complexity detectors while simultaneously exhibiting …

    gatech Repository record for Lattice reduction for MIMO detection: from theoretical analysis to hardware realization (opens in a new tab)

  7. Efficient LLL-based lattice reduction for MIMO detection: From algorithms to implementations

    … (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 with fast …

    gatech Repository record for Efficient LLL-based lattice reduction for MIMO detection: From algorithms to implementations (opens in a new tab)

  8. An analogue of the Korkin-Zolotarev lattice reduction for vector spaces over number fields

    We show the existence of a basis for a vector space over a number field with two key properties. First, the n-th basis vector has a small twisted height which is bounded above by a quantity involving the n-th successive minima associated with the twisted height. Second, at each place v of the …

    texas Repository record for An analogue of the Korkin-Zolotarev lattice reduction for vector spaces over number fields (opens in a new tab)

  9. Lattice-Based Precoding And Decoding in MIMO Fading Systems

    In this thesis, different aspects of lattice-based precoding and decoding for the transmission of digital and analog data over MIMO fading channels are investigated: 1) Lattice-based precoding in MIMO broadcast systems: A new viewpoint for adopting the lattice reduction in communication over MIMO …

    waterloo Repository record for Lattice-Based Precoding And Decoding in MIMO Fading Systems (opens in a new tab)

  10. Lattice-Based Cryptography: A Comparative Study of GGH and NTRU

    … thesis examines the mathematical foundations of lattice based cryptography, with a focus on Goldreich--Goldwasser--Halevi (GGH) and ``Number Theorists R Us" (NTRU). Fundamental concepts of lattice theory such as lattice bases, lattice reduction, Shortest Vector Problem (SVP), and Closest Vector …

    csusb Repository record for Lattice-Based Cryptography: A Comparative Study of GGH and NTRU (opens in a new tab)

  11. Improved Robustness and Versatility of Lattice-Based Cryptography

    … conjectured to be secure against quantum attack. Lattice-based cryptography has been widely recognized as a prominent candidate for practical post-quantum security.This dissertation improves the robustness and versatility of lattice-based cryptography through the following three contributions: 1. …

    maryland Repository record for Improved Robustness and Versatility of Lattice-Based Cryptography (opens in a new tab)

  12. Low-Complexity Near-Optimal Detection Algorithms for MIMO Systems

    … for small and moderate MIMO systems by using lattice reduction and subspace (or conditional) detection techniques. The proposed algorithms exhibit full receive diversity and approach the bit error rate (BER) of the optimal maximum likelihood (ML) solution. For quasi-static channels, the …

    waterloo Repository record for Low-Complexity Near-Optimal Detection Algorithms for MIMO Systems (opens in a new tab)

  13. Applications of Lattices over Wireless Channels

    … fading, interference and asynchronous delays. Lattice coding and decoding provide efficient solutions to many problems in wireless communications and multiuser information theory. The capability in achieving the fundamental limits, together with simple and efficient transmitter and receiver …

    waterloo Repository record for Applications of Lattices over Wireless Channels (opens in a new tab)

  14. A Hybrid Method for Lattice Basis Reduction and Applications

    Lattice reduction aided techniques have been successfully applied to a wide range of 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 …

    mcmaster Repository record for A Hybrid Method for Lattice Basis Reduction and Applications (opens in a new tab)

  15. Overstretched Parameters in Lattice-Based Cryptography

    Lattice-based cryptosystems such as Learning With Errors (LWE) and NTRU have gained popularity as one of the main methods for constructing cryptosystems secure against a quantum attacker. The process of instantiating these involves fixing multiple parameters based on cost estimates for performing …

    chalmers Repository record for Overstretched Parameters in Lattice-Based Cryptography (opens in a new tab)

  16. An investigation of some public key exchange cryptosystems

    … 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 proposed a key exchange protocol based on …

    ttu Repository record for An investigation of some public key exchange cryptosystems (opens in a new tab)

  17. A Collection of New Algorithms in Post-Quantum Cryptography

    … to the identity matrix and performing extra row reductions that manipulate the matrix into a form that still allows Stern's algorithm to be run. We introduce a new problem that cryptosystems can be based on, which uses a permutation of vector components to obfuscate ciphertexts. This thesis …

    carleton Repository record for A Collection of New Algorithms in Post-Quantum Cryptography (opens in a new tab)

  18. Channel-quality-driven high-performance receivers for next generation wireless communication systems

    … at both sides of the communication link, several lattice reduction (LR) algorithms have been proposed to enhance the channel quality within reasonable complexity. In such case, we study the maximum information rate of MIMO transmission with LR-aided linear equalizers and apply LR techniques to …

    gatech Repository record for Channel-quality-driven high-performance receivers for next generation wireless communication systems (opens in a new tab)

  19. Signal processing for ultra fast next generation metallic access network

    … in the field of wireless communications, using lattice reduction as a signal space remapping technique significantly improves the performance of traditional multi-user detectors (MUD) and of the respective multi-user precoders (MUP). These promising techniques have largely remained unexploited …

    soton Download PDF for Signal processing for ultra fast next generation metallic access network (opens in a new tab)

Page 1 of 2