Pages that link to "Item:Q3738458"
From MaRDI portal
The following pages link to A Simple Unpredictable Pseudo-Random Number Generator (Q3738458):
Displaying 17 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)
- A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators (Q3098001) (← links)
- Iteration entropy (Q4629386) (← links)
- Linear complexity of Ding generalized cyclotomic sequences (Q5436224) (← links)
- Side channel cryptanalysis of product ciphers (Q5862295) (← links)
- Two variants of Lempel - Ziv test for binary sequences (Q5871462) (← links)
- On the functional graph of the power map over finite groups (Q6046168) (← links)
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages (Q6125215) (← links)
- A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness (Q6176993) (← links)
- New concepts and construction of quantum random number generators (Q6498713) (← links)
