Legacy encryption systems depend on sharing a key (public or private) among the peers
involved in exchanging an encrypted message. However, this approach poses privacy …

Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …

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

We propose an efficient commutative group action suitable for non-interactive key exchange
in a post-quantum setting. Our construction follows the layout of the Couveignes–Rostovtsev …

In this paper we report on a new record class group computation of an imaginary quadratic
field having 154-digit discriminant, surpassing the previous record of 130 digits. This class …

Massive multiple-input multiple-output (MIMO) is playing a crucial role in the fifth generation
(5G) and beyond 5G (B5G) communication systems. Unfortunately, the complexity of …

The learning with errors (LWE) problem has become a central building block of modern
cryptographic constructions. This work collects and presents hardness results for concrete …

The emerging massive/large-scale multiple-input multiple-output (LS-MIMO) systems that
rely on very large antenna arrays have become a hot topic of wireless communications …

We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on
the learning with errors (LWE) problem. In previous LWE-based FHE schemes, multiplication …

Encoding quantum information into a set of harmonic oscillators is considered a hardware
efficient approach to mitigate noise for reliable quantum information processing. Various …