We present an overview of quantum-safe cryptography (QSC) with a focus on post-quantum
cryptography (PQC) and information-theoretic security. From a cryptographic point of view …

This paper investigates low-dimensional quantizers from the perspective of complex lattices.
We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices and. By …

The concept of verifiable delay functions has received attention from researchers since it
was first proposed in 2018. The applications of verifiable delay are also widespread in …

Conventional Quantization Index Modulation (QIM) has been tailored for diverse data hiding
applications, yet it lacks the ability to achieve minimal distortion in physical layer …

Lattices are a popular field of study in mathematical research, but also in more practical
areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical …

Whilst lattice-based cryptosystems are believed to be resistant to quantum attack, they are
often forced to pay for that security with inefficiencies in implementation. This problem is …

Lattices defined as modules over algebraic rings or orders have garnered interest recently,
particularly in the fields of cryptography and coding theory. Whilst there exist many attempts …

The main of this paper is to prove that in terms of normalized density, a space-time block
code based on an irreducible quadratic polynomial over the Eisenstein integers is an …