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 7 of 7 for “"Ring Learning With Errors"”.

  1. Homomorphic Encryption and Cryptanalysis of Lattice Cryptography

    … thoroughly studying certain attacks against the Ring Learning with Errors problem, 4. precisely characterizing the performance of an algorithm for solving the Approximate Common Divisor problem.

    clemson Repository record for Homomorphic Encryption and Cryptanalysis of Lattice Cryptography (opens in a new tab)

  2. Cyclotomic Polynomials in Ring-LWE Homomorphic Encryption Schemes

    … area, one of the most promising ideas being the Learning With Errors (LWE) problem posed by Oded Regev's. Although this problem has proved to be versatile as a basis for homomorphic encryption schemes, the large key sizes result in a quadratic overhead making this inefficient for practical …

    rit Repository record for Cyclotomic Polynomials in Ring-LWE Homomorphic Encryption Schemes (opens in a new tab)

  3. Pipelined-Parallel Modular Multiplication and Key-Switching Accelerators for Homomorphic Encryption

    … HE schemes are almost exclusively built upon the Ring Learning With Errors (RLWE) problem, utilizing high-degree polynomials and massive ciphertext coefficients broken down via the Residue Number System (RNS). However, the immense computational overhead, severe memory bandwidth bottlenecks, and …

    umn Repository record for Pipelined-Parallel Modular Multiplication and Key-Switching Accelerators for Homomorphic Encryption (opens in a new tab)

  4. Algebraic Number Theory and Lattice-Based Cryptography: Equivalence and Cryptanalysis of RLWE and PLWE

    … One of the well-studied lattice problems is the Learning with Errors (LWE) problem, which was introduced by Oded Regev in 2005. He showed that LWE is at least as hard as certain worst-case lattice problems, which are believed to remain hard even for quantum computers. Despite its strong security …

    aalto Repository record for Algebraic Number Theory and Lattice-Based Cryptography: Equivalence and Cryptanalysis of RLWE and PLWE (opens in a new tab)

  5. Improved Robustness and Versatility of Lattice-Based Cryptography

    … to replacing the quantum-insecure cryptosystems with newly developed "post-quantum" cryptosystem candidates, 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 …

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

  6. Efficiency of Homomorphic Encryption Schemes

    … choices in homomorphic encryption schemes with a variety of techniques to include modulus leveling and techniques of error bound control.

    clemson Repository record for Efficiency of Homomorphic Encryption Schemes (opens in a new tab)