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 43 for “"Lattice-Based Cryptography"”.

  1. 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)

  2. Lattice-based cryptography: protocols and applications

    Lattice-based cryptography began with the groundbreaking work of M. Ajtai [14] back in the 90's and has since then proven to be one of the most versatile approaches for constructing provably secure, efficient, and highly parallelizable cryptographic primitives that can withstand attacks even by …

    greece Repository record for Lattice-based cryptography: protocols and applications (opens in a new tab)

  3. Practical lattice-based cryptography over structured lattices

    … than ever before. <br/><br/>Public key cryptography (PKC) is used in the majority of today's communications systems. The security of public-key cryptographic schemes, such as RSA<br/>and elliptic curve cryptography (ECC), is based on underlying mathematical problems such as factoring …

    qu-belfast Repository record for Practical lattice-based cryptography over structured lattices (opens in a new tab) Download PDF for Practical lattice-based cryptography over structured lattices (opens in a new tab)

  4. Improved Robustness and Versatility of Lattice-Based Cryptography

    Current public key cryptosystems that are based on the hardness of integer factorization and discrete logarithm are insecure in the presence of large-scale quantum computers. Much effort has been devoted to replacing the quantum-insecure cryptosystems with newly developed "post-quantum" …

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

  5. High-Performance VLSI Architectures for Lattice-Based Cryptography

    Lattice-based cryptography is a cryptographic primitive built upon the hard problems on point lattices. Cryptosystems relying on lattice-based cryptography have attracted huge attention in the last decade since they have post-quantum-resistant security and the remarkable construction of the …

    clemson Repository record for High-Performance VLSI Architectures for Lattice-Based Cryptography (opens in a new tab)

  6. Efficient and secure hardware architectures for lattice based cryptography

    … quantum computers and certain quantum computing-based algorithms pose significant threats to current cryptographic algorithms. Public key algorithms, such as RSA and ECC, will no longer be secure in the era of quantum computers. PQC and quantum encryption are two encryption technologies that have …

    qu-belfast Repository record for Efficient and secure hardware architectures for lattice based cryptography (opens in a new tab) Download PDF for Efficient and secure hardware architectures for lattice based cryptography (opens in a new tab)

  7. 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)

  8. ATTRIBUTE-BASED ENCRYPTIONS AND FORMAL VERIFICATION OF LATTICE-BASED CRYPTOGRAPHY

    … works of Ajtai (STOC’96) and Regev (STOC’05), lattice-based cryptography has proven to be a powerful building block in cryptography. My research focuses on further exploring the expressive power of lattice-based cryptography, as well as formal verification of lattice-based cryptographic …

    cornell Repository record for ATTRIBUTE-BASED ENCRYPTIONS AND FORMAL VERIFICATION OF LATTICE-BASED CRYPTOGRAPHY (opens in a new tab)

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

    … attacks. One of the most promising directions is latticebased cryptography, which relies on hard problems around lattices. 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 …

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

  10. A study of post-quantum cryptographic schemes.

    … the leading options for public key post-quantum cryptography are multivariate and lattice-based cryptography. One goal of this work is to introduce and classify the security of the multivariate cryptosystems from the C∗ and Oil and Vinegar families, and attacks that have proven successful against …

    louisville Repository record for A study of post-quantum cryptographic schemes. (opens in a new tab)

  11. Bridging Early and Modern Lattice Cryptosystems: A Theoretical Journey through SVP, LWE and Kyber

    … thesis offers an in-depth theoretical study of lattice-based cryptography, tracing its evolution from early foundational systems to modern standardized constructions. Initially, we examine and emphasize the significance of the Ajtai-Dwork cryptosystem and its foundational worst-case to …

    waterloo Repository record for Bridging Early and Modern Lattice Cryptosystems: A Theoretical Journey through SVP, LWE and Kyber (opens in a new tab)

  12. Lattice based and isogeny based post-quantum cryptography

    Modern cryptography involving public-keys relies on mathematically difficult problems, such as factoring large numbers into prime factors and finding rational points on elliptic curves. A typical public-key scheme involves two communicators who each have a public and a private key. Each party …

    texas Repository record for Lattice based and isogeny based post-quantum cryptography (opens in a new tab)

  13. PRACTICAL POST-QUANTUM CRYPTOGRAPHY & FULLY HOMOMORPHIC ENCRYPTION ON GRAPHICS PROCESSORS: DESIGN & PERFORMANCE EVALUATION

    Lattice cryptography has seen rapid development in the past decade due to its role in enabling various emerging technologies such as post-quantum public-key cryptosystems and Fully Homomorphic Encryption (FHE) schemes that allow computing on encrypted data. In spite of the attractiveness of these …

    nus Repository record for PRACTICAL POST-QUANTUM CRYPTOGRAPHY & FULLY HOMOMORPHIC ENCRYPTION ON GRAPHICS PROCESSORS: DESIGN & PERFORMANCE EVALUATION (opens in a new tab) Download file for PRACTICAL POST-QUANTUM CRYPTOGRAPHY & FULLY HOMOMORPHIC ENCRYPTION ON GRAPHICS PROCESSORS: DESIGN & PERFORMANCE EVALUATION (opens in a new tab)

  14. Cryptology Management in a Quantum Computing Era

    … numbers to resist cryptanalysis. Asymmetric cryptography is used in a plethora of sensitive operations from online bank transactions to international e-commerce, and the Department of Defense also uses asymmetric cryptography to transmit sensitive data. Quantum computers have the potential to …

    nps Repository record for Cryptology Management in a Quantum Computing Era (opens in a new tab)

  15. New Algorithms and Reductions for Hard Cryptographic Problems

    Conjectured hard problems are central to modern cryptography and thus to the security of the networked infrastructure on which modern society is built.We investigate the precise hardness of several such problems. In Chapter 1, we study preprocessing attacks aimed at the on-line inversion of …

    cornell Repository record for New Algorithms and Reductions for Hard Cryptographic Problems (opens in a new tab)

  16. A Fortified Extension of the AES and Its Implementation

    … of quantum computing (QC), the integrity of cryptography has been called into question. For example, two QC algorithms have been developed that can break asymmetric encryption (i.e., Grover’s, Shor’s), which also poses a threat to symmetric encryption. Asymmetric encryption efforts addressing …

    unlv Repository record for A Fortified Extension of the AES and Its Implementation (opens in a new tab) Download PDF for A Fortified Extension of the AES and Its Implementation (opens in a new tab)

  17. Parameter selection in fully homomorphic encryption schemes and fhe applications

    … be solved by quantum systems has increased. Lattice-based cryptography is a prominent tool for the post-quantum era that facilitates the implementation of encryption systems for practical applications.</p><p>The Learning with Error (LWE) and Ring-LWE problems introduce new lattice hardness …

    njit Repository record for Parameter selection in fully homomorphic encryption schemes and fhe applications (opens in a new tab)

  18. Practical Multiparty Protocols From Lattice Assumptions: Threshold Signatures, Oblivious Pseudorandom Functions, And More

    Lattice-based cryptography has emerged as the most dominant replacement candidate for the next generation of post-quantum cryptographic tools. With their operational simplicity while allowing advanced functionality, these protocols lead the majority of post-quantum standardization efforts and …

    maryland Repository record for Practical Multiparty Protocols From Lattice Assumptions: Threshold Signatures, Oblivious Pseudorandom Functions, And More (opens in a new tab)

Page 1 of 3