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 21 for “"Lattice problems"”.
-
Considerations on computational lattice problems
Lattices are discrete subgroups of the Euclidean space. While they are highly structured objects and their elements can easily be described by means of integer linear combinations of their basis vectors, it is possible to define NP-hard problems on them. Due to the existence of a class of lattices …
-
EXPONENTIAL TIME/SPACE ALGORITHMS AND REDUCTIONS FOR LATTICE PROBLEMS
… secure even in the era of quantum computing. Lattice-based cryptosystems stand out as the leading candidates for post-quantum cryptography due to their resistance to quantum attacks. A lattice of rank n is defined as the set of vectors generated by integer linear combinations of n linearly …
-
Advances in Concrete Cryptanalysis of Lattice Problems and Interactive Signature Schemes
… First, we consider the cryptanalysis of lattice problems (used as the basis for current standard quantum resistant cryptosystems). We develop a novel side-channel attack on the FrodoKEM key encapsulation mechanism as submitted to the NIST Post Quantum Cryptography (PQC) standardization …
-
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 …
-
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 …
-
Maximal curves, zeta functions, and digital signatures
… for C. The best algorithms for solving some lattice problems, like finding the shortest vector in an arbitrary lattice, are exponential in run-time. This makes lattice problems a potentially good basis for cryptographic protocols. Right now, lattices are especially important in information …
-
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 …
-
Smoothening Functions and the Homomorphism Learning Problem
… for the existing relationships between LWE and lattice problems. We prove that their smoothing properties does not make them special, but rather, the fact that it is infinitely divisible and l2 symmetric are important properties that make the Gaussian unique.
-
Polynomial Multiplication for Post-Quantum Cryptography
… of most post-quantum cryptography based on hard lattice problems. The first part covers cryptographic schemes specifically designed to benefit from a particular polynomial multiplication technique: Number-theoretic transforms. The second part covers the other lattice-based schemes that were …
-
Reduction-Respecting Parameters for Lattice-Based Cryptosystems
One attractive feature of lattice-based cryptosystems is the existence of security reductions relating the difficulty of breaking the cryptosystem to the difficulty of solving variants of the shortest vector problem (Regev, STOC 2005; Peikert, ePrint 2008). As there are no known polynomial-time …
-
A Fortified Extension of the AES and Its Implementation
… efforts addressing this threat include lattice-based cryptography, which uses lattice problems to reduce efficiency of cryptanalysis. Symmetric encryption security can be bolstered by increasing the key length, allowing for additional permutations a key could have; known as keyspace. …
-
Performance Comparison of Learning with Errors Cryptosystems
… algorithms. Much focus has been given to lattice-based cryptosystems, as certain lattice problems appear difficult even in the quantum setting. In particular, the Learning with Errors (LWE) problem, introduced by Regev, gives a means for constructing numerous public key cryptosystems with …
-
Homomorphic Encryption and the Approximate GCD Problem
… along with functional encryption and the hard problems upon which their security is based. These hard problems include the Approximate GCD problem (A-GCD), the Learning With Errors problem (LWE), and various lattice problems. In addition, we discuss many of the proposed and in some cases …
-
Theoretical Aspects of Randomization in Computation
… bits? In this thesis, we consider important problems in these three prominent and diverse areas pertaining to randomness. In randomness extraction, we present extractors for "oblivious bit fixing sources". In (a non-traditional use of) randomization, we have obtained results in machine …
-
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 …
-
Algebraic Analysis of the Module Lattice Isomorphism Problem
This thesis studies the Module Lattice Isomorphism Problem (MLIP) over Complex Multiplication (CM) fields and the isogeny-finding problem for supersingular elliptic curves over finite fields, with the goal of illuminating an algebraic equivalence or computational reductions between these two …
-
Development of specialized base primitives for meso-scale conforming truss structures
… current design capabilities. Meso-scale lattice structures can now be built that contain more lattice struts than it is reasonable to efficiently define. This work has attempted to create a method for designing such lattice structures that is efficient enough to allow for the design of …
-
Efficient, provably secure code constructions
… Encryption systems) based on the hardness of lattice problems. In Identity Based Encryption (IBE), any arbitrary string such as the user's email address or name can be her public key. IBE systems are powerful and address several problems faced by the deployment of Public Key Encryption. Our …
-
Post-quantum cryptographic algorithms
… primitives with a particular focus on lattice-based algorithms, empahasing on their security, efficiency, and applicability in real-world scenarios. The initial sections of the thesis provide a comprehensive review of the mathematical foundations of post-quantum cryptography, detailing …
-
Multi-orbital quantum phenomena: from magnetic impurities to lattice models with strong Hund's coupling
… mean-field theory (DMFT), to the solution of a lattice model, the multi-orbital Hubbard model with Hund's coupling. A concise introduction to the theoretical background focuses on information directly relevant to the understanding of applied models, methods, and the interpretation of results. It …
Page 1 of 2