The pseudo-random-generator tag has no wiki summary.
-3
votes
0answers
28 views
pseudo random sequence and permutation functions
Iam doing my Master thesis in enhancing of an encryption algorithm by using of a pseudo random sequence generators to create a 16*16 shared table and apply a permutation function on it. one of the ...
1
vote
2answers
83 views
Why is the following RSA PRNG cryptographically secure?
One requirement states that the generator has to withstand the next-bit test.
Consider the following PRNG, where we calculate next output $x_i$ via the formula
$x_i = x_{i-1}^ e\mod n$.
I can see ...
1
vote
1answer
36 views
Pseudo Random Generator (PRG) from Rabin function
I'm trying to make a PRG using the Rabin function. The code (in Java) I wrote to implement the function is:
...
-1
votes
2answers
84 views
How does the rand() function in C work? [closed]
I want to know how rand() works (even when I don't provide any seed how it produces PRNs?) thanks!
4
votes
1answer
102 views
Does Linear Cramer-Shoup have pseudo-random ciphertexts?
"Linear Cramer-Shoup" is defined on pages 4 and 5 of $\:$ eprint.iacr.org/2007/074.pdf .
Are the ciphertexts in Linear Cramer-Shoup computationally indistinguishable from uniform
under a ...
0
votes
3answers
523 views
LFSR for small numbers with large periods
I want to generate a few random numbers using an LFSR. However, the LFSR output depends on the number of taps, so for a large period I use large (relative) number of bits. This causes the numbers to ...
1
vote
2answers
96 views
Pseudorandom generator and AE-secure encryption
How would you answer the following question (i have to translate it from german):
The existence of a pseudorandom generator implies the existence of a AE-Secure encryption scheme (AE = authenticated ...
4
votes
2answers
253 views
Are there any standards of multi-prime RSA key generation?
FIPS 186-3 specifies a method to generate DSA parameters.
Is there anything similar (official standard or widely-accepted recommendation) that shows how to generate the primes for multi-prime RSA?
2
votes
1answer
226 views
How to prove that the concatenation of two secure PRG is secure?
Given $G:\{0,1\}^s \rightarrow \{0, 1\}^n$ a secure PRG, how can one prove that $G'(k_1, k_2) = G(k_1) \cdot G(k_2)$ is secure ($\cdot$ means concatenation)?
In other words, I'd like to show that if ...
