Usage of randomness (i.e. non-predictable data, usually in the form of bits or numbers) for cryptographic purposes.

learn more… | top users | synonyms

3
votes
0answers
51 views

Feasible way to check n-dimensional equidistribution of PRNGs

I am currently gathering some test methods and test suites for random number generator qualities, and am a bit stuck at finding something feasible to test for n-dimensional equidistribution. As input ...
2
votes
0answers
51 views

Why calculate pi to estimate randomness?

Why do testing suites calculate pi using the Monte Carlo method to determine if a series of numbers are random? As far as I can tell, the Monte Carlo method can be used to estimate pi itself (as a ...
1
vote
0answers
32 views

How good is middle cube method with jumbled digits?

I had to make my own prng for a stream cipher for an inter school science project (I am mentioning that a lot). So I thought of cubing the seed instead of squaring it (like in the middle square ...
1
vote
0answers
88 views

To prove $r_2$ is a uniformly at random value in $Z_n$, where $r_2=r_1 . m$

$m$ is arbitrary value in $Z_n$, where n is RSA modulo. Then we do: $r_2=r_1 . m (modn)$, where $r_1$ is a random value such that $r_1\in Z^*_n$. ** Question(1): is $r_2$ a uniformly at random ...
1
vote
0answers
57 views

Special random distribution algorithm

I am implementing ring signatures as a part of an authorization system. Since the number of users could get high enough to make computation on end-user devices infeasible, I am thinking of ...
1
vote
0answers
282 views

Random Number Generation with a Entropy pool versus Seed

To give a little background I'm currently implementing a crypto library in JavaScript. I have started porting across Linux's random number generator because its both publicly scrutinized, it is ...
0
votes
0answers
30 views

Prove that if we redefine the key space, we can assume Gen chooses a key uniformly

I am working on problem 2.1 in Introduction to Modern Cryptography 2nd edition by Katz and Lindell. 2.1) Prove that by redefining the key space, we may assume that the key generation algorithm ...