A Simple Unpredictable Pseudo-Random Number Generator
From MaRDI portal
Publication:3738458
DOI10.1137/0215025zbMath0602.65002DBLPjournals/siamcomp/BlumBS86OpenAlexW2085759780WikidataQ55951424 ScholiaQ55951424MaRDI QIDQ3738458
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cfeb641dc3b188e4e52c13f72ccb78170e98552c
computational complexitycryptographyJacobi symbolpseudorandom numbersperiodpublic-key encryptionone-time padquadratic residuacitysecure transactions
Related Items (92)
On the cycle structure of repeated exponentiation modulo a prime ⋮ Random sequence generation by cellular automata ⋮ Another Look at Tightness ⋮ Linear complexity of the \(x^{2} \bmod p\) orbits ⋮ Reductions among number theoretic problems ⋮ A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ On the notion of infinite pseudorandom sequences ⋮ All Bits in ax + b mod p are Hard ⋮ On using deterministic functions to reduce randomness in probabilistic algorithms ⋮ More efficient DDH pseudorandom generators ⋮ Data mining in electronic commerce ⋮ Generation of pseudo-random numbers with the use of inverse chaotic transformation ⋮ An improved BioHashing for human authentication ⋮ Feedback shift registers, 2-adic span, and combiners with memory ⋮ Power maps in finite groups ⋮ Performance improvement for the GGM-construction of pseudorandom functions ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Cycle structure of iterating Rédei functions ⋮ New pseudo-random number generator based on improved discrete-space chaotic map ⋮ Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ RSA and Elliptic Curve Least Significant Bit Security ⋮ Efficient Construction of Public-Key Matrices in Lattice-Based Cryptography: Chaos Strikes Again ⋮ Are electroencephalogram (EEG) signals pseudo-random number generators? ⋮ On the functional graph of the power map over finite groups ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ Improving classical authentication over a quantum channel ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ More Powerful and Reliable Second-Level Statistical Randomness Tests for NIST SP 800-22 ⋮ On the power generator and its multivariate analogue ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Pseudorandom number generators based on random covers for finite groups ⋮ A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness ⋮ Applications of timed-release encryption with implicit authentication ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ Certifying assembly with formal security proofs: the case of BBS ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ On the uniformity of distribution of the RSA pairs ⋮ Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter Bounds ⋮ On the iteration of certain quadratic maps over GF(\(p\)). ⋮ Aligned Drawings of Planar Graphs ⋮ The graph structure of Chebyshev polynomials over finite fields and applications ⋮ The functional graph of linear maps over finite fields and applications ⋮ Iteration entropy ⋮ On the distribution of the power generator ⋮ Period of the power generator and small values of Carmichael’s function ⋮ Local randomness in pseudorandom sequences ⋮ On pseudorandomness in families of sequences derived from the Legendre symbol ⋮ On the linear complexity of some new \(q\)-ary sequences ⋮ Trace representation of some generalized cyclotomic sequences of length \(pq\) ⋮ Coalgebra and abstraction ⋮ Secure simultaneous bit extraction from Koblitz curves ⋮ Quantum attacks on pseudorandom generators ⋮ A Calculus for Game-Based Security Proofs ⋮ QUAD: A Practical Stream Cipher with Provable Security ⋮ Linear complexity of Ding generalized cyclotomic sequences ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Realistic analysis of some randomized algorithms ⋮ New concepts and construction of quantum random number generators ⋮ 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 ⋮ QUAD: A multivariate stream cipher with provable security ⋮ Session resumption protocols and efficient forward security for TLS 1.3 0-RTT ⋮ Cryptographic hardness for learning intersections of halfspaces ⋮ Uniform random number generation ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ Comparative Analysis of Random Generators ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2 ⋮ A generalized scheme for data encryption technique using a randomized matrix key ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions ⋮ A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ Some remarks on FCSRs and implications for stream ciphers ⋮ An overview of distinguishing attacks on stream ciphers ⋮ Distributional properties of \(d\)-FCSR sequences ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ Key Refreshing in Wireless Sensor Networks ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations ⋮ An efficient binary sequence generator with cryptographic applications ⋮ Probabilistic encryption ⋮ Formal security proofs with minimal fuss: implicit computational complexity at work ⋮ Side channel cryptanalysis of product ciphers ⋮ How to Exchange Half a Bit ⋮ Little extension of Euler's criterion for quadratic residue ⋮ The discrete logarithm modulo a composite hides \(O(n)\) bits ⋮ Efficient, perfect polynomial random number generators ⋮ A comparison of two approaches to pseudorandomness ⋮ Two variants of Lempel - Ziv test for binary sequences ⋮ On the distribution of the Diffie-Hellman pairs
This page was built for publication: A Simple Unpredictable Pseudo-Random Number Generator
