LEAP: High-Performance Lattice-Based Pseudorandom Number Generator [PDF]
IACR Transactions on Symmetric CryptologyAt EUROCRYPT2012, Banerjee, Peikert, and Rosen introduced Ring Learning With Rounding (RLWR) problem and constructed lattice-based pseudorandom functions for the first time.
Yu Zhang +4 more
doaj +3 more sources
Pseudorandom number generation with self programmable cellular automata [PDF]
, 2004 In this paper, we propose a new class of cellular automata – self programming cellular automata (SPCA) with specific application to pseudorandom number generation. By changing a cell's state transition rules in relation to factors such as its neighboring
Guan, SU, Tan, SK
core +7 more sources
Incremental evolution of cellular automata for random number generation [PDF]
, 2003 Cellular automata (CA) have been used in pseudorandom number generation for over a decade. Recent studies show that controllable CA (CCA) can generate better random sequences than conventional one-dimensional (1-d) CA and compete with two-dimensional (2 ...
Guan, SU, Zhang, S
core +8 more sources
An Evolutionary Approach to the Design of Controllable Cellular Automata Structure for Random Number Generation [PDF]
, 2003 Cellular Automata (CA) has been used in pseudorandom number generation over a decade. Recent studies show that two-dimensional (2-d) CA Pseudorandom Number Generators (PRNGs) may generate better random sequences than conventional one-dimensional (1-d) CA
Guan, SU, Zhang, S
core +6 more sources
Gaussian Pseudorandom Number Generator Using Linear Feedback Shift Registers in Extended Fields
Mathematics, 2021 A new proposal to generate pseudorandom numbers with Gaussian distribution is presented. The generator is a generalization to the extended field GF(2n) of the one using cyclic rotations of linear feedback shift registers (LFSRs) originally defined in GF ...
Guillermo Cotrina +2 more
doaj +1 more source
Configurable cellular automata for pseudorandom number generation [PDF]
, 2005 This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed.
Guan, SU +3 more
core +1 more source
Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers.
PLoS ONE, 2023 Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary ...
Kiyoshiro Okada +3 more
doaj +1 more source
Pseudorandom number generation based on controllable cellular automata [PDF]
, 2003 A novel Cellular Automata (CA) Controllable CA (CCA) is proposed in this paper. Further, CCA are applied in Pseudorandom Number Generation. Randomness test results on CCA Pseudorandom Number Generators (PRNGs) show that they are better than 1-d CA PRNGs
Zhang, S. +5 more
core +1 more source
Chaos Based Cryptographic Pseudo-Random Number Generator Template with Dynamic State Change
Applied Sciences, 2020 This article presents a configurable, high-throughput pseudo-random number generator template targeting cryptographic applications. The template is parameterized using a chaotic map that generates data, an entropy builder that is used to periodically ...
Octaviana Datcu +2 more
doaj +1 more source
On Combining Pseudorandom Number Generators
The Annals of Statistics, 1979 A technique used in pseudorandom number generation is to combine two or more different generators with the goal of producing a new generator with improved randomness properties. We study such a class of generators and show that in a strong sense the combined generator does offer improvement. Our approach applies results from majorization theory.
Brown, Mark, Solomon, Herbert
openaire +3 more sources