Pages that link to "Item:Q3738458"
From MaRDI portal
The following pages link to A Simple Unpredictable Pseudo-Random Number Generator (Q3738458):
Displaying 50 items.
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- Are electroencephalogram (EEG) signals pseudo-random number generators? (Q396242) (← links)
- Improving classical authentication over a quantum channel (Q406240) (← links)
- On the power generator and its multivariate analogue (Q413475) (← links)
- Pseudorandom number generators based on random covers for finite groups (Q420634) (← links)
- Certifying assembly with formal security proofs: the case of BBS (Q436406) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- An improved BioHashing for human authentication (Q856473) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- On the linear complexity of some new \(q\)-ary sequences (Q942314) (← links)
- Trace representation of some generalized cyclotomic sequences of length \(pq\) (Q942315) (← links)
- An overview of distinguishing attacks on stream ciphers (Q1032489) (← links)
- Probabilistic encryption (Q1057832) (← links)
- Random sequence generation by cellular automata (Q1082817) (← links)
- Reductions among number theoretic problems (Q1091136) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137) (← links)
- Local randomness in pseudorandom sequences (Q1180515) (← links)
- Linear complexity of generalized cyclotomic binary sequences of order 2 (Q1266420) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- Feedback shift registers, 2-adic span, and combiners with memory (Q1363072) (← links)
- Dynamical analysis of a class of Euclidean algorithms. (Q1401315) (← links)
- On the iteration of certain quadratic maps over GF(\(p\)). (Q1426120) (← links)
- A comparison of two approaches to pseudorandomness (Q1605323) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- Generation of pseudo-random numbers with the use of inverse chaotic transformation (Q1643968) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses (Q1706614) (← links)
- The graph structure of Chebyshev polynomials over finite fields and applications (Q1727357) (← links)
- The functional graph of linear maps over finite fields and applications (Q1727359) (← links)
- Secure simultaneous bit extraction from Koblitz curves (Q1755988) (← links)
- Uniform random number generation (Q1805480) (← links)
- Distributional properties of \(d\)-FCSR sequences (Q1827571) (← links)
- On the cycle structure of repeated exponentiation modulo a prime (Q1876236) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Predicting masked linear pseudorandom number generators over finite fields (Q1949235) (← links)
- Coalgebra and abstraction (Q1981994) (← links)
- Little extension of Euler's criterion for quadratic residue (Q2107681) (← links)
- A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods (Q2182710) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- Constructing digitized chaotic time series with a guaranteed enhanced period (Q2285727) (← links)
- On the distribution of quadratic residues and non-residues modulo composite integers and applications to cryptography (Q2287820) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Data mining in electronic commerce (Q2381785) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Cycle structure of iterating Rédei functions (Q2397505) (← links)
