Search results

...That is, evaluating any low-degree polynomial at a point determined by the pseudorandom string is statistically close to evaluating the same polynomial at a point ...andom generators for low-degree polynomials are a particular instance of [[pseudorandom generator]]s for statistical tests, where the statistical tests considered ...

....0&verb=Display&handle=euclid.aoap/1177005878 A New Class of Random Number Generators], George Marsaglia and Arif Zaman, The Annals of Applied Probability, Vol. "Lagged Fibonacci" refers to the fact that each random number is a function of two of the preceding numbers at some specified, fixed offs ...

{{short description|Family of pseudorandom number generators}} ...odulo 2| journal = ACM Transactions on Mathematical Software| volume = 32| number = 1| pages = 1–16| date = March 2006| last1 = Panneton | first1 = Fra ...

The '''Blum–Micali algorithm''' is a [[cryptographically secure pseudorandom number generator]]. The algorithm gets its security from the difficulty of computi ...0. This is equivalent to using one bit of <math>x_i</math> as your random number. It has been shown that <math>n - c - 1</math> bits of <math>x_i</math> can ...

...posite moduli <math>m=p_1,\dots p_r</math> with arbitrary distinct [[Prime number|primes]] <math>p_1,\dots ,p_r \ge 5</math> will be present here. where <math> \varphi(m)=(p_{1}-1)\dots (p_{r}-1)</math> denotes the number of positive integers less than ''m'' which are [[Coprime|relatively prime]] ...

|class=[[pseudorandom number generator]] |caption=A [[pseudorandom number generator]]. ...

...eger counter as its internal state. They are generally used for generating pseudorandom numbers for large parallel computations. ...orms a series of bits known as the ''state'' into a new state and a random number. ...

...ds, the players know the other's variables, but not their own. The minimum number of bits that must be communicated by the players to compute ''f'' is the [[ ...A_1,A_2,...,Ax_n)</math>. The cost of a multiparty protocol is the maximum number of bits communicated for any <math>x</math> from the set {0,1}<sup>''n''</s ...

{{short description|Describes flaws with the pseudorandom numbers from a linear congruential generator}} .... Poorly chosen values for the modulus and multiplier in a [[Lehmer random number generator]] will lead to a short period for the sequence of random numbers. ...

...the input octet string. The output of a mask generation function should be pseudorandom, that is, if the seed to the function is unknown, it should be infeasible t ...orithm|symmetric-key encryption]], and yielding outputs for [[pseudorandom number generator]]s. ...

{{Short description|Statistical test for linear congruential generators}} ...0,000 values generated with [[RANDU]]. Each point represents 3 consecutive pseudorandom values. It is clearly seen that the points fall in 15 [[2D geometric model| ...

'''Gimli''' is a 384-bit cryptographically secure [[pseudorandom permutation]] that can be used to construct a [[hash function]] or [[stream ...nts starting from 24 and when it reaches 24, 20, 16, 12, 8 or 4, the round number or {{Mono|0x9e377900}} is xored into the first word of the state. ...

{{short description|Pseudo-random number generator algorithm}} ...ruential generator''' ('''CLCG''') is a [[Pseudorandomness|pseudo-random]] number generator [[algorithm]] based on combining two or more [[linear congruentia ...

...tice structure of certain linear congruential sequences related to AWC/SWB generators |title=Efficient Multiply-with-Carry Random Number Generators with Maximal Period ...

...om function family|pseudorandom function]]. Let ''p'' and ''l'' be [[prime number]]s with ''l'' |''p''−1. Select an element ''g'' ∈ <math> {\mathbb F_p}^*</m There are other attacks that would be very bad for a [[pseudorandom number generator]]: the user expects to get random numbers from the output, so of ...

...source, a randomness extractor can even be considered to be a true random number generator ([[Hardware_random_number_generator|TRNG]]); but there is no sing ....edu/~trevisan/pubs/extractor-full.pdf| title= Extractors and Pseudorandom Generators|author = Luca Trevisan| accessdate=2013-10-21}}</ref>) However, the general ...

...he [[Numerical analysis|numerical]] practice of generating [[pseudo-random number]]s (PRN) that follow a given [[probability distribution]]. ...[Uniform distribution (continuous)|uniformly distributed]] [[pseudo-random number generator|PRN generator]]. Computational algorithms are then used to manipu ...

...odes]], [[mask generation function]]s, [[stream cipher]]s, [[pseudo-random number generator]]s, and [[authenticated encryption]].<ref name=duplex>{{cite web ''f'' produces a [[pseudorandom permutation]] of the <math>2^b</math> states from ''S''. ...

...5/355744.355750|s2cid=12884505|doi-access=free}}</ref> for [[pseudo-random number sampling]], that is, for drawing random samples from a [[statistical distri ...ast2= Hörmann| title= Runuran: R Interface to the 'UNU.RAN' Random Variate Generators | year= 2021 | url= https://CRAN.R-project.org/package=Runuran}}</ref> cont ...

...l yet, or any of the other more recent ones? (Though, judging by the sheer number of reductions that the proposal has to go through, I would guess that it wo ...ity)#NC0|NC⁰]].<ref name=":0" /> (The existence of pseudorandom generators in NC⁰ (even with sub-linear stretch) was a long-standing open p ...