Questions tagged [pseudo-random-generator]
In cryptography, a pseudo-random generator (PRG) is a deterministic procedure that maps a random seed to a longer pseudo-random string such that no statistical test can distinguish between the output of the generator and the uniform distribution. Pseudo-random generators have numerous applications in cryptography. For instance, pseudo-random generators provide an efficient analog of one-time pads.
601 questions
1 vote
1 answer
99 views
PRGs and non linear FSRs
My understanding is that we can formally prove that PRGs can generate a polynomial length pseudorandom expansion of the seed. But don't the FSRs with non linear feedback like Trivium claim to generate ...
- 273
2 votes
3 answers
272 views
Keccak SHAKE subsequent fetch can be considered as valid PRNG?
I have read the Keccak team document about PRNG. When you hash with Keccak SHAKE the amount of random bytes you wish to return is unlimited, i.e. I can fetch() as ...
- 195
4 votes
2 answers
128 views
Security strength of DRBG
The security strength of Hash based DRBG (Hash_DRBG and HMAC_DRBG) confuses me. Which property of Hash determines the security strength of DRBG? For example, which SHA2 algorithms can be used to ...
- 41
2 votes
2 answers
180 views
Application of True Randomness generators in Cryptography
What is the exact application or True Randomness in Cryptography, either symmetric or public key? It is well known that the symmetric keys of encryption algorithms are supposed to be chosen randomly ...
- 191
2 votes
0 answers
49 views
Explanation of the Maximum Period of the Multiply Lagged Fibonacci Generator (MLFG)
Could explain in an accessible way why the maximum period of the Multiply Lagged Fibonacci Generator (MLFG) is $ (2^k - 1) \times 2^{M-3} $? My understanding is that $ (2^k - 1) $ represents the ...
- 321
0 votes
1 answer
108 views
Why Hull-Dobell choose 4?
In the Hull-Dobell theorem for Linear Congruential Generators (LCGs), the third condition states that if 4 divides m (i.e., $ 4 \mid m $), then 4 must divide $ a-1 $ (i.e., $ 4 \mid (a-1) $). Why is ...
- 321
1 vote
1 answer
186 views
Is it possible to crack glibc version 2.35 rand/srand to be able to predict future values if i only know the modulus of the consecutive outputs?
I have one hundred integers inside an array that are consecutive outputs from rand() which are modulo'd by a magic number such as 41, inside an array like so: ...
- 13
0 votes
1 answer
127 views
Is XOR-scrambling with a seeded RNG a secure alternative to standard AES modes?
I'm writing an application that encrypts data with a shared key using AES in ECB mode. The level of security for this application isn't extremely high. But I do want to scramble the blocks before ...
1 vote
7 answers
2k views
Why Pseudo-Random Number Generator? Why not Unpredictable Number Generator?
While reading about PRNG theory, I'm always seeing "it is hard to determine whether the stream is really random". Do we really need a random stream? Maybe a better option is just an ...
4 votes
2 answers
275 views
State lotteries using Hardware RNG to generate combinations (opportunity for unethical behavior?) [closed]
The state lotteries in Arizona, Oregon, and Washington State have abandoned ball machines in favor of computer generated combinations using Hardware RNG. Do these computer generated systems follow a ...
- 91
1 vote
1 answer
281 views
Information conservation with random bitstrings and full addition circuitry
I've been interested in studying information content in the context of algorithms, especially PRNGs. Originally inspired by the entropy extracting properties of the XOR gate, I wanted to simulate ...
- 195
-1 votes
3 answers
235 views
Has there been any research that shows the human mind can produce true random numbers, without the help of dice, PRNGs etc.?
It is invariably stated that the human mind cannot produce random passwords, numbers etc. because patterns and preferences emerge. I propose that this is wrong, and that with practise it is possible. ...
- 137
3 votes
2 answers
897 views
Uniform random number generation on an arbitrary interval
Supposing that one has reliably random data of uniform distribution to use as an input, how can an integer in the range $[0, k-1]$ be selected at random without bias and in constant-time with respect ...
- 4,328
0 votes
0 answers
81 views
How to break truncated linear conguential generator with partial information?
This question is related to these: 1 2 But the answers do not state clearly on how and no example code is given which makes harder for a beginner to understand lattice attack on TLCG. I have an ...
1 vote
0 answers
92 views
Does such public keys results means something about the random number generator?
As you know, elliptic curve key generation involve picking a random scalar and multiply it by the Generator point. A strong characteristic of secure random number generation is each of the bits has ½ ...
- 283