Questions tagged [random-number-generator]
A random number generator is a software or hardware solution which functions as a generator of (real or pseudo) random numbers (or bits).
-1
votes
1answer
49 views
Brute forcing/hacking Secure passphrases - difficulty for random strings vs real words
I was wondering about this topic of brute forcing passwords,or ANY other way to deriving them - and asking myself whats more secure (relatively):
A Password which includes
A) 30 digits length- a ...
0
votes
2answers
51 views
secret and unique random number generator within a range
I am trying to think of a way to generate secret and unique random numbers within a range.
Say we have a public range [1-n], how could we have a maximum of n users choose a random number within this ...
2
votes
1answer
93 views
What are implementations of PRNGs based on ChaCha20? [closed]
I thought I'd find an implementation in NaCl, but /dev/urandom is what I find. Search engines samples revealed most implementations are broken.
What libraries are ...
2
votes
3answers
133 views
Low entropy - how does it compromise the crypto
One of the often pointed out mistake in dealing with crypto is not having enough entropy in the system. Without enough entropy the random numbers generated are not random enough.
But what I am not ...
2
votes
1answer
69 views
How was the 5 digit random number in the VIC cipher generated?
Knowing that VIC was a "spy cipher" it is unlikely that the agents used a cryptographic device to genreate the 5 digit number but how did they do it?
5
votes
3answers
416 views
Hardware RNG Bias
I have generator based on sampled noise (reverse-biased transistor - actually ChaosKey but that's not that important).
The noise source is fed into ADC and sampled with 16bit resolution (2 bytes). ...
-2
votes
1answer
53 views
Method for generating random number(s) [closed]
I was reading about random numbers and their usage in security. I'd like to verify with more experienced people how good this method of generating random numbers will be.
Human beings are very hard ...
6
votes
1answer
124 views
Distinguishing generators of RSA primes and moduli
We are trying to distinguish two RSA prime generators:
Prime generator 1
draw uniformly at random an integer $p$ with $2^{1023.5}<p<2^{1024}$, until it is prime
output $p$.
Prime generator 2
...
3
votes
2answers
2k views
Example of cryptography random number
I read that random numbers are being used in cryptography and security. I think I have idea how to truly generate true random, non-deterministic number. But before continuing further I'd like to ask ...
2
votes
0answers
42 views
Generating sets of unreadable/secure and unique random numbers
In the process of some research I have been doing I stumbled across the following 2 claims on the PokerStars website.
We do record all of the hole cards in all real money hands. This is an
...
2
votes
1answer
58 views
In the Linux Kernel 4.8+, does the CSPRNG update the entropy pool?
My understanding of how /dev/urandom works is that the kernel collects true randomness from a variety of sources, and mixes them together to remove statistical bias. It does this at regular intervals ...
4
votes
1answer
310 views
Salsa20 as a PRNG with streams
Can I use Salsa20 as a good non-cryptographic PRNG with different streams if I reduce the number of rounds to 8 and omit the addition step at the end? I want to omit the final step because I don't ...
0
votes
0answers
73 views
Set passes Dieharder randomness with ints values, fails when ints are split into bytes
I've generated 100M of random numbers in range (0..255). These numbers fail Dieharder tasts (bitnum = 8). However, I can pass this test by combining four bytes into an int.
Randomness of the set didn'...
1
vote
1answer
78 views
Can POS devices really generate random numbers?
I am doing an implementation of a system designed by a payment company and I am a little skeptical about the way they have designed the end to end cryptography.
The system is as follows:
There are ...
8
votes
5answers
830 views
Entropy vs predictability in PRNGs
If entropy is the measure of surprise, and a given PRNG has a uniform distribution, then the entropy would be high. So the Mersenne Twister(MT) has high entropy.
But the MT is also predictable. You ...
0
votes
0answers
39 views
How to get unknown constants from linear congruential generator
I need to crack this linear congruential generator.
I have
$$X_{n+1}=a⋅X_n +b \pmod m$$
I know: $m=31,X_3=30,X_4=19,X_5=26$
How can I find $a,b$ and $X_0$?
I have got already the following ...
0
votes
2answers
112 views
Aes Ctr non-secure PRNG
I want to construct a seeder for a big state PRNG (xorshift1024 based) and have been thinking about using Aes Ctr using multiple 256 bit keys, where the counter is simply encrypted multiple times (...
3
votes
1answer
109 views
Implementing randomness extractors
A randomness extractor is a function that takes an input sampled from high entropy distribution and outputs a value that is close to uniform distribution. It is slightly different from a PRG. PRGs ...
5
votes
1answer
214 views
Exactly what RNG weaknesses endanger (EC)DSA?
RFC 6979 defines deterministic variants of (EC)DSA. It states in introduction
One characteristic of DSA and ECDSA is that they need to produce, for each signature generation, a fresh random ...
1
vote
2answers
211 views
Choosing a Random Number Generator algorithm to encrypt a message
What are the best cryptographically secure pseudo-random number generator algorithms, and what are their strengths/weaknesses? I can't seem to come up with a list of them (or maybe I do, but they ...
3
votes
3answers
3k views
Cryptography's random number problem?
Sophie Chen at Wired Magazine;
quantum mechanics could solve cryptography's random number problem
Such machine already exist, but it's too huge and not so fast in order to use it all the time.
...
2
votes
0answers
45 views
Do any bits from the standard Mersenne Twister repeat more often than the total period? [closed]
While the total period of MT19937 is $2^{19937}-1$ by design, is the period of the sequence of any of the individual bits from the output less than this? I'll admit I'm far too unfamiliar with group ...
1
vote
1answer
88 views
Interpretation of (NIST) Non Overlapping Template Matching Test
Regarding the Non-Overlapping Template test, this test normally gives us a bunch of p-values (148 values). I would like to ask that how do we interpret those values into a single p-value for ...
1
vote
2answers
76 views
Is it possible to test 15-bit PRNG with the library TestU01?
The library TestU01 inconvenient for generators that don't produce 32-bit outputs. But is it possible to somehow test say a 15-bit generator with it? How could that be done?
For instance, the ...
0
votes
2answers
130 views
Blockchain cryptography
I'm a high school student doing a project about blockchain. I'm trying to figure out why hashing algorithms are crucial for the existence of blockchain and other types of cryptography wouldn't work. ...
0
votes
1answer
102 views
How might one create a system of election by lot (sortition) that is both secure and verifiable?
I've been puzzling recently over sortition, a democratic method of selection for public office which I find very fascinating. Basically, instead of choosing candidates like Hillary Clinton or Donald ...
5
votes
1answer
2k views
Do hash functions need to “look random”?
I've noticed that looking random is not often listed as a requirement for a good hash function in the same way that preimage or collision resistance is.
Do we need hash functions to look random?
...
15
votes
2answers
2k views
What is the difference between TRNG and CSPRNG?
I understand the output of a TRNG is almost impossible to reproduce, such a flipping a coin 100 times to produce a 100-bit sequence. However, it is also my understanding that a CSPRNG produces an ...
2
votes
1answer
112 views
Making PRNG cryptographically secure thru shuffling?
Is it practical to make a PRNG cryptographically secure if I shuffle the randomly generated numbers (say 256-bit) several times before hashing it, even if a hacker knows when I generate the numbers?
...
3
votes
1answer
440 views
Is SHA1 secured enough as a PRNG
I read SHA1 is still a secured hashing function with no collision found as of now. However, it's just a matter of time for someone to come up with such a collision or attack. Therefore, in new ...
1
vote
2answers
71 views
Encryption using deterministic CSPRNG as secure as CSPRNG
As a beginner it seems that a scheme derived from a CSPRNG should be as secure as that CSPRNG. Is this a correct assumption? Are there restrictions or known special cases? A rough outline would be:
...
0
votes
1answer
106 views
Does hashing a PRNG by a cryptographically secure hashing algorithm result in a CSPRNG?
Or specifically, does ChaCha20 hashing of the xoroshiro128+ random number generator result in a cryptographically secure random number generator?
0
votes
1answer
119 views
python secrets security evaluation [closed]
The python library secrets gives a title as;
"Secrets - Generate secure random numbers for managing secrets"
and makes a distinction from "random module" by
In particularly, secrets should be ...
1
vote
1answer
382 views
How to generate tokens from a secret key?
The problem is simple: I want to be able to spit out 256-bit "tokens" that only I could've produced because I know my secret key $s$, and given any number of these tokens, no one can figure what $s$ ...
1
vote
0answers
50 views
Mersenne Twister's vulnerabilty with small-size distributions
C++ rookie here, trying to wrap his head around (CS)PRNGs.
I (assume that I) already understand the concept of the Mersenne Twister being "broken" (i.e. not cryptographically secure) due to its ...
3
votes
1answer
55 views
Randomizing Prime Field Elements
I need my code to generate random elements from $GF(p)$ ($F_p$ or $Z_p$, if you will).
The Crypto API I have available provides one with random bit strings. To tailor that to my needs, I can think of ...
2
votes
1answer
68 views
adaptation of NIST sp800-22 for short sequences
I would like to ask about the NIST test suite for randomness evaluation. The test suite consists of 15 subtests which evaluate the particular property of the sequence.
In fact, each test has an ...
2
votes
1answer
280 views
HMAC-SHA512 output randomness?
This is regarding an online roulette game that claims to be fair. Here is the explanation:
Two strings are created:
...
1
vote
2answers
257 views
How is a ciphertext encrypted using random numbers decrypted using a symmetric key algorithm
We use true random number generators as a source of keys for encryption. What I can not wrap my head around is: How is this cipher text decrypted in case of symmetric key algorithm as we need the same ...
2
votes
0answers
34 views
ZK-proof of usage in a seed of CSPRNG
Assume a Player chooses a seed $s$ and he wants to prove that he uses it as a seed to CSPRNG function, where the seed is not public.
How can he prove it?
Thanks.
1
vote
0answers
32 views
Can you rely on the permutation of a ciphertext for secrecy?
Say you have a message and you run it through an all-or-nothing transform. A transform that requires every single block in the correct order in order to recover any data. Each block is ...
1
vote
1answer
110 views
repeatedly hashing result and using reverse sequence as RNG secure?
I want to have a source of randomness for which:
no one but me can predict the next number in the sequence.
I know the entire sequence in advance, but I have no way of manipulating it once the first ...
3
votes
1answer
99 views
Cryptanalysis on affine like matrix based strange cryptographic scheme [closed]
This is a garage made encryption scheme provided as cryptanalysis practice during 34C3 CTF.
The challenge is done under the following assumptions
All Mersenne twister instances are MT19937 64bit ...
1
vote
1answer
90 views
LFS Kolmogorov Randomness
Consider following LFS register (where + denotes addition modulo 2)
I have found the output sequence as 1,0,1,1.
I know that The K(s) of a string s is defined as the length of the shortest computer ...
4
votes
1answer
277 views
Identifying the type of algorithm for a PRNG that uses modular multiplication and addition
GNU libc uses the following pseudo-random number generator: $$(\mathit{state} \times 1,103,515,245) + 12,345 \pmod {2^{31}}$$ where state is the result of the previous call to the generator.
My ...
0
votes
5answers
187 views
Pseudorandom number generator for which it is impossible to deduce the seed
I'm looking for an RNG that in the case that an attacker would get all or part (most likely part) of the pseudorandom data, there will be no way for them to deduce the original seed more efficiently ...
3
votes
2answers
164 views
Is this a good way extracting randomness from some physical process?
Let's say the system has a hardware randomness generator, generating random numbers using a proven truly random process. The distribution of the numbers though, is unknown.
Assume the randomness ...
8
votes
1answer
1k views
Why does BCRYPT_RNG_DUAL_EC_ALGORITHM get removed from CNG API on Windows 10?
On article at => Microsoft Docs
CNG Algorithm Identifiers
I notice that BCRYPT_RNG_DUAL_EC_ALGORITHM is now removed since Windows 10.
Beginning with Windows ...
1
vote
0answers
41 views
Geometry of the outputs of linear congruential random number generators
I learned that possible $m$ long sequences produced by linear congruential random number generators(of the form $r_{i+1}\equiv ar_i+b \mod n$) fall on hyperplanes. Using this fact I have come to think ...
1
vote
0answers
80 views
What is the fastest way to generate truly random one time pad without electrical or any other complicated device?
I want to generate truly random one time pad as fast as possible but without the use of any electrical or any other complicated device. What is the fastest way to do that?
