Some excellent surveys of the Gaussian random number generators (GRNGs) from the
algorithmic perspective exist in the published literature to date (eg, Thomas et al.[2007]). In …

Post-Quantum Cryptography (PQC) will become soon the standard for many systems of the
future. With the advent of quantum computers, all encrypted communications based on …

Lattice-based public key cryptography often requires sampling from discrete Gaussian
distributions. In this paper we present an efficient hardware implementation of a discrete …

We describe new arithmetic coding techniques and side-channel blinding countermeasures
for lattice-based cryptography. Using these techniques, we develop a practical, compact …

Machine learning (ML) has seen a major rise in popularity on edge devices in recent years,
ranging from IoT devices to self-driving cars. Security in a critical consideration on these …

Security parameters and attack countermeasures for Lattice-based cryptosystems have not
yet matured to the level that we now expect from RSA and Elliptic Curve implementations …

Generating Gaussian random numbers is essential in many applications such as
cryptography, games, and computer simulations. Although software Gaussian Random …

While the notion of achieving “quantum supremacy” may be debatable, rapid developments
in the field of quantum computing are heading towards more realistic quantum computers …

For numerous computationally complex applications, like financial modelling and Monte
Carlo simulations, the fast generation of high quality non-uniform random numbers (RNs) is …

Nonuniform random numbers are key for many technical applications, and designing
efficient hardware implementations of non‐uniform random number generators is a very …