Questions tagged [pseudo-random-generators]
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
21
questions with no upvoted or accepted answers
5
votes
0answers
140 views
Will the Mersenne Twister PRNG eventually produce all integer sequences of a certain length?
I'm attempting to use the MT19937 variant of the Mersenne Twister PRNG to accomplish something. Whether or not this something is feasible depends upon the answers to these two questions:
What is the ...
3
votes
0answers
25 views
Generation of pseudorandom floating point numbers on floating point vector DSP
I am working on a custom IEEE754 floating point vector signal processor with 64 cores and need to generate pseudo-random floating point numbers at high rate. The only numerical operation available to ...
3
votes
0answers
66 views
creating new PRF from existing one
I have encountered a problem in class, tried solving it and faced a problem, I will include my ideas, and the problems i faced.
Assume F is a PRF,
1.denote $P_k(x) = F_k(x) ⊕ F_k(1^n)$ for any $n ∈ ...
3
votes
0answers
117 views
Origin of Mersenne Twister tempering parameter 'd'?
Short version: common MT (and MT64) implementations have a tempering parameter 'd' (a bit mask). The papers I've looked at describing MT don't include it. Where is it from? When was it added?
Long ...
3
votes
0answers
976 views
NFA random generator
I'm working on a NFA to DFA conversion tool that is different from the Subset Construction and I need to test this tool.
In order to be sure that the immplementation has no bug I'd like to generate a ...
2
votes
0answers
28 views
Simple way to extend period of LCG (expected cycle length)?
Let's consider 128-bit pseudorandom generator. From Harris 1960, if we model uniform random permutation, we know that every period length $l$ has equal probability $1/n$ (Eq. 5.2) for any particular ...
2
votes
0answers
31 views
What are the recent research directions in the topic of circuit lower bounds from derandomization?
I am thinking of the classical paper, https://www.cs.sfu.ca/~kabanets/Research/poly.html
Can someome link to some papers/reviews that give a sampling of what are the recent thoughts in this direction?...
2
votes
0answers
45 views
Mersenne twister middle word
In some literature, as well as in Wikipedia, the middle term parameter m of Mersenne twister is called "number of parallel sequences". Why? What is meant here by "parallel sequences"?
1
vote
0answers
23 views
Generating a fast permutation function over an integer range
Is there a way to generate a bijection over integers $F : [0..n) \rightarrow [0..n)$ that satisfies the properties:
$n$ is arbitrarily chosen and can be any positive integer
$F$ generates a ...
1
vote
0answers
55 views
Pseudo random generator that is non injective
I was reading answer to https://crypto.stackexchange.com/questions/24941/prove-there-is-prg-that-is-not-necessarily-one-to-one
Here assuming existence of G: from n bit to l(n) bits non injective G' ...
1
vote
0answers
63 views
What is a minimal, pseudo-random hash function?
I want to generate pseudo-random hashes of inputs in a way that is optimally time and space efficient.
I'm not at all concerned about security. The output should be evenly distributed and appear ...
1
vote
0answers
55 views
Is it possible to build a secure PRG from two functions one of them being a PRG?
Having two deterministic functions $G_1, G_2 : \left\{0,1\right\}^\lambda \rightarrow \left\{0,1\right\}^{\lambda+l}$, at least one of which is a secure PRG.
Being $\alpha$ a constant, is it possible ...
1
vote
0answers
30 views
Pseudo-random regex-searchable function
Let $L$ be the set of strings of length $n$ (say $n=400$, for example). Let $N = \{0,1,\dots,|L|-1\}$. I am looking for a function $f : N \to L$ with the following properties:
$f$ is efficiently ...
1
vote
0answers
32 views
Generation of 11 bit random number
I need camera to sign one random line(there are something like 2000 lines) from the frame each second.
At the beginning I have some 64 bits seed with high entropy from physical RNG and a secure ...
0
votes
0answers
32 views
How efficient to generate truly random numbers using QRNG?
I know that for pseudo-random numbers the efficiency is very high because they tend to generate a large quantity of random numbers in a short amount of time. So, how efficient to generate truly random ...
0
votes
0answers
34 views
If g is a PRG and f is a OWF, is G'(x) = f(g(x)) a PRG?
Just like the title states.
If I have a pseudo-random generator $g\colon \Sigma^n \rightarrow \Sigma^{2n}$ and a one-way function $f$, is $g'(x)=f(g(x))$ a pseudo-random generator? And why?
My ...
0
votes
0answers
39 views
Asking for your help with LFSR, linear automaton
I am a software developer new to the site. I am currently learning about LFSR (linear feedback shift register). Every day I solve a question which is given to me, but today I am lost. I can not solve ...
0
votes
0answers
54 views
arithmetic coding for generating random number with desired distribution
Hi i want to convert random number with uniform distribution to desired distribution using arithmetic coding. It has been done in the following research paper called arithmetic distribution coding ...
0
votes
0answers
109 views
What is known about the equidistribution properties of Philox pseudo random number generator?
I want to evaluate the usefulness of Philox pseudo random number generator for drawing multidimensional random vectors. What is known about the equidistribution properties of Philox?
I read the ...
0
votes
0answers
19 views
Generating symmetric keys
Let's assume that we have to generate huge number of 256-bit symmetric keys. How to do it and how to be sure that it is safe. Perhaps it requires a strong mathematical backend. Don't hesitate to ...
0
votes
0answers
958 views
Non repeating pseudo random number generator for a dynamic range
Algorithms like Knuth's algorithm or this one, works for a range that is known in advance(like shuffling numbers 1 to 11), in this case the range will never change. You'll always get a random no. ...
