English
Related papers

Related papers: Design and implementation of a novel cryptographic…

200 papers

Generating secure random numbers is vital to the security and privacy infrastructures we rely on today. Having a computer system generate a secure random number is not a trivial problem due to the deterministic nature of computer systems.…

Cryptography and Security · Computer Science 2018-04-10 JV Roig

Randomness is a fundamental feature of quantum mechanics, which is an invaluable resource for both classical and quantum technologies. Practical quantum random number generators (QRNG) usually need to trust their devices, but their security…

Quantum Physics · Physics 2021-03-15 Marco Avesani , Hamid Tebyanian , Paolo Villoresi , Giuseppe Vallone

Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type is considered. The…

Chaotic Dynamics · Physics 2008-01-28 C. Pellicer-Lostao , R. Lopez-Ruiz

We present results of an extensive test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. The generators include public domain programs,…

High Energy Physics - Lattice · Physics 2009-10-22 I. Vattulainen , K. Kankaala , J. Saarinen , T. Ala-Nissila

For globally connected devices like smart phones, personal computers and Internet-of-things devices, the ability to generate random numbers is essential for execution of cryptographic protocols responsible for information security.…

Quantum Physics · Physics 2021-02-25 Mario Stipčević , Ivan Michel Antolović , Claudio Bruschini , Edoardo Charbon

Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games,…

Quantum Physics · Physics 2015-05-27 Mario Stipcevic

We propose a novel pseudorandom number generator based on R\"ossler attractor and bent Boolean function. We estimated the output bits properties by number of statistical tests. The results of the cryptanalysis show that the new pseudorandom…

Cryptography and Security · Computer Science 2018-07-31 Borislav Stoyanov , Krzysztof Szczypiorski , Krasimir Kordov

In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the…

Cryptography and Security · Computer Science 2014-09-19 O. Benamara , F. Merazka

A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can…

True random number generator (TRNG) plays a vital role in a variety of security applications and protocols. The security and privacy of an asset rely on the encryption, which solely depends on the quality of random numbers. Memory chips are…

Cryptography and Security · Computer Science 2019-03-27 B. M. S. Bahar Talukder , Joseph Kerns , Biswajit Ray , Thomas Morris , Md Tauhidur Rahman

We discuss the current state of the art of Quantum Random Number Generators (QRNG) and their possible applications in the search for quantum advantages. To this aim, we first discuss a possible way of benchmarking QRNG by applying them to…

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

Random number generation is a key technology that is useful in a variety of ways. Random numbers are often used to generate keys for data encryption. Random numbers generated at a sufficiently long length can encrypt sensitive data and make…

Hardware Architecture · Computer Science 2022-09-12 Jacob Hammond

Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom…

Quantum Physics · Physics 2020-04-07 Zvika Brakerski , Omri Shmueli

Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the…

Information Theory · Computer Science 2024-04-04 Francisco-Javier Soto , Ana I. Gómez , Domingo Gómez-Pérez

Random numbers are commonly used in many different fields, ranging from simulations in fundamental science to security applications. In some critical cases, as Bell's tests and cryptography, the random numbers are required to be both secure…

Quantum Physics · Physics 2019-01-14 Marco Avesani , Davide G. Marangon , Giuseppe Vallone , Paolo Villoresi

Quantum random number generators (QRNGs) can significantly improve the security of cryptographic protocols, by ensuring that generated keys cannot be predicted. However, the cost, size, and power requirements of current QRNGs has prevented…

Quantum Physics · Physics 2014-10-03 Bruno Sanguinetti , Anthony Martin , Hugo Zbinden , Nicolas Gisin

Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to…

Source independent quantum random number generators (SI-QRNG) are cryptographic protocols which attempt to extract random strings from quantum sources where the source is under the control of an adversary while the measurement devices are…

Quantum Physics · Physics 2021-09-07 Minwoo Bae , Walter O. Krawec

We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and…

Computational Complexity · Computer Science 2012-10-02 Parikshit Gopalan , Raghu Meka , Omer Reingold , Luca Trevisan , Salil Vadhan
‹ Prev 1 3 4 5 6 7 10 Next ›