Due to the fundamentally different approach underlying quantum cryptography (QC), it has
not only become competitive, but also has significant advantages over traditional …

Learning with Rounding (LWR) is a lattice-based cryptographically hard problem which
quantum computers find difficult to solve. LWR problem is a derandomized variant of …

Extensive research has demonstrated that memristors or trigonometric functions can
enhance the complexity of discrete chaotic maps. This article introduces a four-dimensional …

Pseudorandom number generators (PRNGs) are important in cryptography and have been
used in several security applications, such as authentication protocols, session keys, key …

In many areas, such as simulation, numerical analysis, computer programming, decision-
making, entertainment, and coding, a random number input is required. The pseudo-random …

Robust Random Number Generators (RNGs) are indispensable components in modern
cryptographic systems, secure communications, and various other applications where …

In this work, a high throughput method for generating high-quality Pseudo-Random
Numbers using the bitslicing technique is proposed. In such a technique, instead of the …

Recently, there has been a growing interest among researchers in Pseudo-Random Binary
Sequences (PRBS) for Quantum Key Distribution (QKD). QKD is a cryptographic protocol …

In this work, by employing a bitsliced data representation as building blocks of algorithms,
we showcase the capability and scalability of our proposed method in a variety of PRNG …

In the growing Internet of Things (IoT) environment, ensuring that data connections are
secure is paramount. This paper presents a small, innovative solution for storing color …