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 24 for “"Post-Quantum"”.
-
Post-Quantum Verifiable Oblivious Pseudorandom Functions
This work presents the construction of a post-quantum verifiable oblivious pseudorandom function (VOPRF) with a focus on efficiency and practicality. Leveraging lattice-based cryptographic primitives, particularly the Learning With Errors (LWE) problem, our VOPRF construction aims to address the …
-
Architectures for Code-based Post-Quantum Cryptography
L'abstract è presente nell'allegato / the abstract is in the attachment
-
A Post-Quantum Secure RISC-V application core for IoT: from hardware design to applications
L'abstract è presente nell'allegato / the abstract is in the attachment
-
FPGA Implementation and Optimization of Bit Flipping Key Generation Algorithm for Post Quantum Cryptography in Embedded Systems Applications
The expeditious advancement of quantum computing has created a threat to classic cryptographic systems, calling for post-quantum cryptography (PQC) solutions like Bit Flipping Key Encapsulation (BIKE) algorithm, which utilizes Quasi-Cyclic Moderate Density Parity-Check (QC-MCPC) codes for a secure …
-
Cryptographic Innovations in Blockchain
… another open problem is the introduction of post-quantum algorithms that do not compromise the scalability of the blockchain itself. This work focuses on four different proposals aimed at improving or analyzing some of the currently used algorithms. First, TRIFORS, a ring signature based on a …
-
Classical Commitments to Quantum States
We define the notion of a classical commitment to quantum state scheme, which allows a quantum prover to compute a classical commitment to a quantum state and later open each qubit of the state in either the standard or Hadamard basis, while limiting communication with the verifier to a classical …
-
Resource-constrained and Resource-efficient Modern Cryptosystem Design
… modern cryptosystems. The driving application is post-quantum public-key schemes. I first demonstrate energy-efficient computing techniques for post-quantum digital signatures. Then, I propose an area-efficient partitioning and a Hardware/Software codesign for its implementation. The results of …
-
Verifying Correctness of the Number Theoretic Transform and Fast Number Theoretic Transform in F⋆
… and has recently gained importance in post-quantum cryptography. This thesis presents a proof of correctness of the NTT in F⋆ , a proof-oriented programming language that extracts to OCaml, and shows that we can use the NTT to perform polynomial multiplications. We provide an …
-
Entropy Estimation for Arbiter PUF and Applications to Authenticated Key Exchange
… multi-bit APUF response. Our mAKE has proved post-quantum cryptographic security in the random oracle model. The main building block of our construction is a new hash-based robust and reusable Fuzzy Extractor (rrFE) that is obtained by extending the reusable FE in Canetti et al. We implement …
-
Efficient Algorithms, Protocols and Hardware Architectures for Next-Generation Cryptography in Embedded Systems
… lattice-based cryptography and other post-quantum cryptography algorithms are demonstrated with up to two orders of magnitude energy savings compared to state-of-the-art software and hardware. These configurable hardware accelerators are further coupled with a low-power micro-processor …
-
Efficient Architecture and Implementation for NTRU Based Systems
… polynomial Ring Units) is probably the only post quantum public key cryptosystem suitable for practical implementation. Recently, several NTRU based systems have also been shown having property of homomorphic encryption with important application in cloud computing security. In this thesis, …
-
Ensuring reliable and secure deployment of emergent workloads on modern microprocessors
… part of this thesis explores the resilience of post-quantum secure algorithms and implementations against physical attacks. The plausible advent of general-purpose quantum computing in the coming decades poses a mounting threat to contemporary public-key cryptography. This threat spurred the …
-
Frontiers in Lattice Cryptography and Program Obfuscation
… Cryptography, which is the primary sub-area of post-quantum cryptographic research. Our first contribution is the construction of a deniable attribute-based encryption scheme from lattices. A deniable encryption scheme is secure against not only eavesdropping attacks as required by semantic …
-
Code-Based Digital Signature Schemes: Construction, Cryptanalysis and Theoretical Foundations
In recent decades, numerous code-based digital signature schemes following the hash&sign paradigm have been proposed, often turning out to be insecure and demonstrating that the cryptographic community still seems far from a satisfactory solution in this area. The first major question we pose in …
-
Practical lattice-based cryptography over structured lattices
… these schemes will be insecure when a full-scale quantum computer is developed, as these problems will be solvable in polynomial time. Therefore attention has moved towards post-quantum, or quantum-safe, cryptography (QSC). <br/><br/>In 2016, the National Institute of Standards and Technology …
-
Cryptographic Applications of Group Actions from Linear Algebra
L'abstract è presente nell'allegato / the abstract is in the attachment
-
Analysis of Lightweight Cryptographic Primitives
… block size and future capabilities such as quantum computers. This thesis analyzes lightweight cryptographic primitives that would be suitable for use in IoT devices, helping fill a gap for "good enough" security within the size, weight, and power (SWaP) constraints common to IoT devices. …
Page 1 of 2