Questions tagged [randomness]
Usage of randomness (i.e. non-predictable data, usually in the form of bits or numbers) for cryptographic purposes.
583 questions
4
votes
1
answer
231
views
Strength of AES when 32-bits of the 128-bit key are known?
This could be related to any cipher, but this is specific so some AES hardware. In this hardware, a 128-bit random number is exchanged, as one does, between hosts. Due to a hardware quirk, the last ...
- 5,375
9
votes
2
answers
2k
views
Non-committing? Have we been using *deniable* authenticated encryption all along?
Committing security is growing in importance as a set of properties for authenticated encryption in symmetric settings. This notion is defined by Bellare, Hoang, and Wu as:
$\underline{\small \textrm{...
- 1,324
1
vote
0
answers
41
views
Vector-Based Invertible Neural Networks for Experimental PQC [closed]
Summary
This is an experimental exploration of using high-dimensional vector spaces and invertible neural networks (INNs) to harden classical encryption against potential post-quantum attacks. The ...
- 11
1
vote
1
answer
199
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
1
vote
2
answers
384
views
Getting runtime down for algorithms to find safe- and Sophie-Germain primes
My algorithm's latest run found 5 (4096-bit, 1233-digit) safe or Sophie Germain primes in 6 hours and 59 minutes, after 11,190,811 attempts. It doesn't use any libraries, public or otherwise—just a ...
- 17
1
vote
1
answer
128
views
Does the leftover hash lemma imply or require hashing with random salts?
As I understand the leftover hash lemma: I pick a hash function $h$ at random from an $2$-universal family of hash functions. I pick a random string $s$, and then $(h(x,s),s)$ is statistically close ...
- 1,920
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 ...
-1
votes
3
answers
239
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
376
views
Is there any reason why the time to ping a website does not produce true, cryptographically secure, random numbers?
From the MacOS terminal (in Central London) I ping a website on the other side of the world (a café in Tokyo), then take the last digit of the ping time in milliseconds e.g. 289.642 ms becomes 2. I ...
- 137
3
votes
2
answers
903
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
1
vote
0
answers
80
views
How does reseeding vs. changing the parameters of xorshift change its randomness / properties?
I have a 32-bit xorshift PRNG. In my setup (see below), generating a single number takes 6 "cycles", and parallelizing is straightforward. I intend to run 6 at once and concatenate their ...
- 111
5
votes
2
answers
348
views
Can wave-phase recurrence reveal structure in RNGs that pass all entropy tests?
I've been developing a diagnostic framework that analyzes RNG behavior by tracking the timing and phase of number recurrence—not just frequency or independence.
Core Idea:
NAVSYS maps numeric streams ...
1
vote
0
answers
95
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 ½ ...
- 343
1
vote
1
answer
214
views
Gathering entropy at different times using a cycle counter
For non-cryptographic purposes (which use a HWRNG instead), I implemented into a bare metal program a Xorshift* RNG (Taken from [1], see below for implementation).
The RNG is currently seeded with the ...
- 13
1
vote
1
answer
90
views
Is this expected behavior from a source of randomness?
I have an interest in cryptography, information theory, high performance computing and computer science in general, although I enjoy exploring said activities only as a hobby; I am am no professional ...
- 371
