science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string...
4 KB (575 words) - 13:50, 22 April 2025
cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string...
14 KB (1,864 words) - 00:22, 20 June 2025
A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG), is an algorithm for generating a sequence of numbers...
28 KB (3,559 words) - 14:58, 27 June 2025
cryptographically secure pseudorandom number generator (CSPRNG) or cryptographic pseudorandom number generator (CPRNG) is a pseudorandom number generator (PRNG) with...
29 KB (3,633 words) - 08:24, 16 April 2025
A pseudorandom binary sequence (PRBS), pseudorandom binary code or pseudorandom bitstream is a binary sequence that, while generated with a deterministic...
8 KB (1,064 words) - 16:26, 5 February 2024
Lagged Fibonacci generator (LFG or sometimes LFib) is an example of a pseudorandom number generator. This class of random number generator is aimed at being...
7 KB (974 words) - 17:22, 20 July 2025
encryption schemes. Pseudorandom functions are not to be confused with pseudorandom generators (PRGs). The guarantee of a PRG is that a single output appears...
8 KB (1,021 words) - 19:33, 30 June 2025
equation. The method represents one of the oldest and best-known pseudorandom number generator algorithms. The theory behind them is relatively easy to understand...
43 KB (4,864 words) - 20:43, 19 June 2025
Inversive congruential generators are a type of nonlinear congruential pseudorandom number generator, which use the modular multiplicative inverse (if...
12 KB (2,172 words) - 19:27, 28 December 2024
search for polynomials of the shape xn + ax + b.[citation needed] Irreducible polynomials over finite fields are also useful for pseudorandom number generators...
31 KB (4,636 words) - 07:47, 21 July 2025
In cryptography, the shrinking generator is a form of pseudorandom number generator intended to be used in a stream cipher. It was published in Crypto...
5 KB (573 words) - 13:28, 10 February 2025
pseudorandom generators is related to the existence of one-way functions through a number of theorems, collectively referred to as the pseudorandom generator...
14 KB (1,933 words) - 18:11, 26 June 2023
Mersenne Twister (category Pseudorandom number generators)
The Mersenne Twister is a general-purpose pseudorandom number generator (PRNG) developed in 1997 by Makoto Matsumoto (松本 眞) and Takuji Nishimura (西村 拓士)...
32 KB (3,995 words) - 08:37, 22 June 2025
In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation (that is, a permutation selected...
10 KB (1,303 words) - 13:43, 26 May 2025
for various cryptographic primitives in private key as well as public-key cryptography. Their result is the construction of an efficient pseudorandom...
11 KB (1,975 words) - 18:53, 25 January 2024
Linear-feedback shift register (redirect from Polynomial counter)
examples of maximal-length feedback polynomials (primitive polynomials) for shift-register lengths up to 24. The formalism for maximum-length LFSRs was developed...
38 KB (4,725 words) - 03:54, 18 July 2025
A5/1 (section Using A5/1 as pseudorandom generator)
degrees of the three registers are relatively prime, the period of this generator is the product of the periods of the three registers. Thus the period...
23 KB (2,725 words) - 00:35, 9 August 2024
monic polynomial of small degree. Prime numbers are used in a number of applications such as hash table sizing, pseudorandom number generators and in...
14 KB (2,253 words) - 23:11, 19 May 2025
In cryptography, an alternating step generator (ASG) is a cryptographic pseudorandom number generator used in stream ciphers, based on three linear-feedback...
4 KB (565 words) - 21:37, 29 October 2023
Root-finding algorithm (redirect from Root-finding of polynomials)
However, for polynomials specifically, the study of root-finding algorithms belongs to computer algebra, since algebraic properties of polynomials are fundamental...
17 KB (2,724 words) - 08:18, 15 July 2025
Well equidistributed long-period linear (category Pseudorandom number generators)
Well Equidistributed Long-period Linear (WELL) is a family of pseudorandom number generators developed in 2006 by François Panneton, Pierre L'Ecuyer, and...
4 KB (343 words) - 14:55, 13 April 2025
Computational indistinguishability (redirect from Polynomial-time indistinguishable)
indistinguishability.: 108 Lecture 4 - Computational Indistinguishability, Pseudorandom Generators Goldreich, O. (2003). Foundations of cryptography. Cambridge, UK:...
3 KB (420 words) - 18:47, 28 October 2022
Maximum length sequence (redirect from Pseudorandom m-sequence)
represented as coefficients of irreducible polynomials in a polynomial ring over Z/2Z. Practical applications for MLS include measuring impulse responses...
12 KB (1,638 words) - 00:56, 20 June 2025
BPP (complexity) (redirect from Bounded error probability in polynomial time)
strong pseudorandom number generators is conjectured by most experts of the field. Such generators could replace true random numbers in any polynomial-time...
19 KB (2,456 words) - 20:16, 27 May 2025
Complementary sequences (category Pseudorandom number generators)
^{2}=2N\,} for all z on the unit circle, that is, |z| = 1. If so, A and B form a Golay pair of polynomials. Examples include the Shapiro polynomials, which...
9 KB (1,223 words) - 07:46, 29 October 2024
self-shrinking generator is a pseudorandom generator that is based on the shrinking generator concept. Variants of the self-shrinking generator based on a...
4 KB (477 words) - 16:59, 27 July 2024
minimal polynomials are irreducible, all primitive polynomials are also irreducible. A primitive polynomial must have a non-zero constant term, for otherwise...
10 KB (1,353 words) - 03:41, 19 July 2025
Verifiable random function (category Pseudorandomness)
In cryptography, a verifiable random function (VRF) is a public-key pseudorandom function that provides proofs that its outputs were calculated correctly...
12 KB (1,501 words) - 13:21, 26 May 2025
Xorshift (category Pseudorandom number generators)
Xorshift random number generators, also called shift-register generators, are a class of pseudorandom number generators that were invented by George Marsaglia...
28 KB (3,526 words) - 11:34, 3 June 2025
Semantic security (section Use of Cryptographically Secure Pseudorandom Number Generators (CSPRNGs))
Technology (NIST). 2019-05-23. "A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications". National Institute of...
14 KB (1,435 words) - 10:02, 20 May 2025