English
Related papers

Related papers: Entropy Assessment of Windows OS Performance Count…

200 papers

We describe random processes (with binary alphabet) whose entropy is less than 1 (per letter), but they mimic true random process, i.e., by definition, generated sequence can be interpreted as the result of the flips of a fair coin with…

Information Theory · Computer Science 2015-12-23 Boris Ryabko

AI-Hybrid TRNG is a deep-learning framework that extracts near-uniform entropy directly from physical noise, eliminating the need for bulky quantum devices or expensive laboratory-grade RF receivers. Instead, it relies on a low-cost,…

Cryptography and Security · Computer Science 2025-07-02 Hasan Yiğit

Machine learning relies on randomness as a fundamental component in various steps such as data sampling, data augmentation, weight initialization, and optimization. Most machine learning frameworks use pseudorandom number generators as the…

Cryptography and Security · Computer Science 2026-02-11 Kotekar Annapoorna Prabhu , Andrew Gan , Zahra Ghodsi

The classical combinatorics-based password strength formula provides a result in tens of bits, whereas the NIST Entropy Estimation Suite give a result between 0 and 1 for Min-entropy. In this work, we present a newly developed metric --…

Cryptography and Security · Computer Science 2024-04-29 Khan Reaz , Gerhard Wunder

Pseudo-random number generators (PRNGs) play an important role to ensure the security and confidentiality of image cryptographic algorithms. Their primary function is to generate a sequence of numbers that possesses unpredictability and…

Cryptography and Security · Computer Science 2023-07-11 Takreem Haider , Saúl A. Blanco , Umar Hayat

This paper explores the development and viability of an alternative pseudorandom number generator (PRNG) that leverages the chaotic dynamics of multiple pendulum systems. Some traditional PRNGs, notably the one implemented in the…

Cryptography and Security · Computer Science 2024-04-29 Matthew Sigit

This paper studies the notion of computational entropy. Using techniques from convex optimization, we investigate the following problems: (a) Can we derandomize the computational entropy? More precisely, for the computational entropy, what…

Information Theory · Computer Science 2013-05-17 Maciej Skórski

Cybersecurity often hinges on unpredictability, with a system's defenses being strongest when sensitive values and behaviors cannot be anticipated by attackers. This paper explores the concept of entropy injection-deliberately infusing…

Cryptography and Security · Computer Science 2025-04-17 Kush Janani

In this paper, we analyze several critical issues in semi-device independent quantum information processing protocol. In practical experimental realization randomness generation in that scenario is possible only if the efficiency of the…

Quantum Physics · Physics 2015-06-23 Hong-Wei Li , Zhen-Qiang Yin , Marcin Pawlowski , Guang-Can Guo , Zheng-Fu Han

A Physically Unclonable Function (PUF) is a hardware security primitive used for authentication and key generation. It takes an input bit-vector challenge and produces a single-bit response, resulting in a challenge-response pair (CRP). The…

Cryptography and Security · Computer Science 2024-07-01 Vincent Dumoulin , Wenjing Rao , Natasha Devroye

Self-testing and Semi-Device Independent protocols are becoming the preferred choice for quantum technologies, being able to certify their quantum nature with few assumptions and simple experimental implementations. In particular for…

Quantum Physics · Physics 2020-07-15 Davide Rusca , Hamid Tebyanian , Anthony Martin , Hugo Zbinden

Pseudorandom number generators (PRNGs) are ubiquitous in stochastic simulations and machine learning (ML), where they drive sampling, parameter initialization, regularization, and data shuffling. While widely used, the potential impact of…

Performance · Computer Science 2025-10-30 Benjamin A. Antunes

Pseudo-random number generators (PRNG) are a fundamental element of many security algorithms. We introduce a novel approach to their implementation, by proposing the use of generative adversarial networks (GAN) to train a neural network to…

Machine Learning · Computer Science 2018-10-02 Marcello De Bernardi , MHR Khouzani , Pasquale Malacaria

This paper targets to search so-called \emph{good} generators by doing a brief survey over the generators developed in the history of pseudo-random number generators (PRNGs), verify their claims and rank them based on strong empirical tests…

Cryptography and Security · Computer Science 2025-08-19 Kamalika Bhattacharjee , Sukanta Das

Thermal jitter (phase noise) from a free-running ring oscillator is a common, easily implementable physical randomness source in True Random Number Generators (TRNGs). We show how to evaluate entropy, autocorrelation, and bit pattern…

Cryptography and Security · Computer Science 2021-10-13 Markku-Juhani O. Saarinen

Individual and group decisions are complex, often involving choosing an apt alternative from a multitude of options. Evaluating pairwise comparisons breaks down such complex decision problems into tractable ones. Pairwise comparison…

Artificial Intelligence · Computer Science 2018-06-13 Purushottam D. Dixit

We propose a new DRAM-based true random number generator (TRNG) that leverages DRAM cells as an entropy source. The key idea is to intentionally violate the DRAM access timing parameters and use the resulting errors as the source of…

Hardware Architecture · Computer Science 2018-12-27 Jeremie S. Kim , Minesh Patel , Hasan Hassan , Lois Orosa , Onur Mutlu

Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy.…

Quantum Physics · Physics 2017-02-28 Miguel Herrero-Collantes , Juan Carlos Garcia-Escartin

The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random…

Cryptography and Security · Computer Science 2025-03-25 Juan Di Mauro , Eduardo Salazar , Hugo D. Scolnik

We present a novel, computationally simple method of hiding any message in the stream of random bits by using a secret key. The method is called Bury Among Random Numbers (BARN). A stream of random bits is produced by extracting the entropy…

Cryptography and Security · Computer Science 2024-04-16 Jan J. Tatarkiewicz , Wieslaw B. Kuzmicz
‹ Prev 1 3 4 5 6 7 10 Next ›