Pages that link to "Item:Q3738458"
From MaRDI portal
The following pages link to A Simple Unpredictable Pseudo-Random Number Generator (Q3738458):
Displayed 35 items.
- 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)
- 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)
- 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)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- Data mining in electronic commerce (Q2381785) (← links)
- On pseudorandomness in families of sequences derived from the Legendre symbol (Q2460689) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- An efficient binary sequence generator with cryptographic applications (Q2570684) (← links)
- On the uniformity of distribution of the RSA pairs (Q2701565) (← links)
- On the distribution of the power generator (Q2723530) (← links)
- Period of the power generator and small values of Carmichael’s function (Q2723531) (← links)
- QUAD: A Practical Stream Cipher with Provable Security (Q3593092) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
- Linear complexity of Ding generalized cyclotomic sequences (Q5436224) (← links)
- Key Refreshing in Wireless Sensor Networks (Q5502799) (← links)
- Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)