A Simple Unpredictable Pseudo-Random Number Generator
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient, perfect polynomial random number generators
- Probabilistic encryption
- On the linear complexity of some new q-ary sequences
- An efficient binary sequence generator with cryptographic applications
- Coalgebra and abstraction
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- Reliability conditions for the two-level testing approach of the NIST SP800-22 test suite
- QUAD: A Practical Stream Cipher with Provable Security
- Cryptographic hardness for learning intersections of halfspaces
- Comparative Analysis of Random Generators
- Reductions among number theoretic problems
- Are electroencephalogram (EEG) signals pseudo-random number generators?
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Little extension of Euler's criterion for quadratic residue
- On using deterministic functions to reduce randomness in probabilistic algorithms
- A comparison of two approaches to pseudorandomness
- Power maps in finite groups
- Improving classical authentication over a quantum channel
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- scientific article; zbMATH DE number 465355 (Why is no real title available?)
- RSA and elliptic curve least significant bit security
- On the power generator and its multivariate analogue
- Pseudorandom number generators based on random covers for finite groups
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Paradigms for Unconditional Pseudorandom Generators
- Iteration entropy
- Side channel cryptanalysis of product ciphers
- On the iteration of certain quadratic maps over GF(\(p\)).
- Immunizing backdoored PRGs
- More powerful and reliable second-level statistical randomness tests for NIST SP 800-22
- Developments in secure random number generators
- Random sequence generation by cellular automata
- An improved BioHashing for human authentication
- Compact zero-knowledge arguments for Blum integers
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
- All bits in ax + b p are hard
- The discrete logarithm modulo a composite hides \(O(n)\) bits
- Certifying assembly with formal security proofs: the case of BBS
- Secure simultaneous bit extraction from Koblitz curves
- QUAD: A multivariate stream cipher with provable security
- Performance improvement for the GGM-construction of pseudorandom functions
- Linear complexity of the \(x^{2} \bmod p\) orbits
- Two variants of Lempel - Ziv test for binary sequences
- On the distribution of quadratic residues and non-residues modulo composite integers and applications to cryptography
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Linear complexity of Ding generalized cyclotomic sequences
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- Linear complexity of generalized cyclotomic binary sequences of order 2
- On the distribution of the Diffie-Hellman pairs
- Revisiting the security proof of QUAD stream cipher: some corrections and tighter bounds
- On the cycle structure of repeated exponentiation modulo a prime
- Feedback shift registers, 2-adic span, and combiners with memory
- On pseudorandomness in families of sequences derived from the Legendre symbol
- Generation of pseudo-random numbers with the use of inverse chaotic transformation
- A forkcipher-based pseudo-random number generator
- Cryptography Based on Quadratic Forms: Complexity Considerations
- On the uniformity of distribution of the RSA pairs
- A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness
- New pseudo-random number generator based on improved discrete-space chaotic map
- On the notion of infinite pseudorandom sequences
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- A novel pseudorandom number generator based on the conservative chaotic system with non-smooth nonlinearities
- On the functional graph of the power map over finite groups
- Efficient construction of public-key matrices in lattice-based cryptography: chaos strikes again
- Applications of timed-release encryption with implicit authentication
- The pseudorandomness of Legendre symbols under the quadratic-residuosity assumption
- How to Exchange Half a Bit
- Quantum hardness of learning shallow classical circuits
- Cycle structure of iterating Rédei functions
- Building Secure Block Ciphers on Generic Attacks Assumptions
- Data mining in electronic commerce
- A Calculus for Game-Based Security Proofs
- Formal security proofs with minimal fuss: implicit computational complexity at work
- The functional graph of linear maps over finite fields and applications
- Inferring sequences produced by pseudo-random number generators
- Cut-down de Bruijn sequences
- On the possibility of a backdoor in the Micali-Schnorr generator
- The graph structure of Chebyshev polynomials over finite fields and applications
- Local randomness in pseudorandom sequences
- scientific article; zbMATH DE number 4186981 (Why is no real title available?)
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Constructing digitized chaotic time series with a guaranteed enhanced period
- Pattern occurrence in the dyadic expansion of square root of two and an analysis of pseudorandom number generators
- Another look at tightness
- On the distribution of the power generator
- Period of the power generator and small values of Carmichael's function
- Key Refreshing in Wireless Sensor Networks
- Practical chosen ciphertext secure encryption from factoring
- Predicting masked linear pseudorandom number generators over finite fields
- Aligned drawings of planar graphs
- A SIMPLE GENERATION METHOD OF PHYSICAL RANDOM DIGITS
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Uniform random number generation
- New concepts and construction of quantum random number generators
- Dynamical analysis of a class of Euclidean algorithms.
- An overview of distinguishing attacks on stream ciphers
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods
- Attacking the Pollard Generator
- Realistic analysis of some randomized algorithms
- More efficient DDH pseudorandom generators
This page was built for publication: A Simple Unpredictable Pseudo-Random Number Generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738458)
