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