Achieving fully homomorphic encryption was a longstanding open problem in cryptography
until it was resolved by Gentry in 2009. Soon after, several homomorphic encryption …

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

As we move into a new decade, the global world of Intelligent Infrastructure (II) services
integrated into the Internet of Things (IoT) are at the forefront of technological advancements …

Traditional encryption schemes, both symmetric and asymmetric, were not designed to
respect any algebraic structure of the plaintext and ciphertext spaces, ie no computations …

Traditional encryption schemes, both symmetric and asymmetric, were not designed to
respect the algebraic structure of the plaintext and ciphertext spaces. Many schemes, such …

Enumeration is a fundamental lattice algorithm. We show how to speed up enumeration on a
quantum computer, which affects the security estimates of several lattice-based submissions …

Traditional encryption schemes, both symmetric and asymmetric, were not designed to
respect any algebraic structure of the plaintext and ciphertext spaces, ie no computations …

Lattice-based cryptography is currently under consideration for standardization in the
ongoing NIST PQC Post-Quantum Cryptography competition, and is used as the basis for …

This paper describes the lattice problems that are key in the study of lattice-based
cryptography, identifies and categorizes methods for solving these problems, analyzes …

The learning with errors (LWE) problem is considered as one of the most compelling
candidates as the security base for the post-quantum cryptosystems. For the application of …