Data privacy concerns are increasing significantly in the context of the Internet of Things,
cloud services, edge computing, artificial intelligence applications, and other applications …

Currently deployed public-key cryptosystems will be vulnerable to attacks by full-scale
quantum computers. Consequently," quantum resistant" cryptosystems are in high demand …

Learning with Errors (LWE) is a hard math problem used in post-quantum cryptography.
Homomorphic Encryption (HE) schemes rely on the hardness of the LWE problem for their …

Learning with Errors (LWE) is a hard math problem underpinning many proposed post-
quantum cryptographic (PQC) systems. The only PQC Key Exchange Mechanism (KEM) …

As lattice-based key encapsulation, digital signature, and fully homomorphic encryption
schemes near standardisation, ever more focus is being directed to the precise estimation of …

Learning with Errors (LWE) is a hard math problem underlying recently standardized post-
quantum cryptography (PQC) systems for key exchange and digital signatures. Prior work …

We extend two of the attacks on the PLWE problem presented in (Y. Elias, KE Lauter, E.
Ozman, and KE Stange, Ring-LWE Cryptography for the Number Theorist, in Directions in …

The bounded distance decoding (BDD) is a fundamental problem in lattice-based
cryptography which is derived from the closest vector problem (CVP). In this paper, we adapt …

Encryption is necessary to ensure the security of online communications. Many different
methods of encryption are available. The Rivest–Shamir–Adleman (RSA) cryptosystem is a …

The main focus of this Ph. D thesis lies on the computational problem Learning With Errors
(LWE). It is a core building block of lattice-based cryptography, which itself is among the …