Blum, Blum and Shub Pseudo Random Bit Generator
NewBitGenerator( opt1, opt2 )
(optional) argument of the form option=value where option is one of range or seed
The NewGenerator command outputs a Maple procedure, a pseudo-random number generator, which when called outputs a pseudo-random number. The generator is a Blum-Blum-Shub (BBS) generator. A BBS generator uses the following quadratic recurrence to generate a sequence of integers x1,⁢x2,⁢… from which cryptographically secure pseudo-random bits z1,⁢z2,⁢… are extracted:
n is a product of two large primes p and q,
x0 is determined from the seed s.
Each iteration of zk+1, the least significant m bits of xk+1, generates m cryptographically secure bits. The output of the generator depends on the options described below.
The cryptographic security of the BBS generator assumes that the number theoretic problem of distinguishing a quadratic residue from a pseudo-square in Z mod n is computationally infeasible when n is the product of two primes p and q and the factorization of n is not known. Thus it also assumes that integer factorization is computationally infeasible. Recall the definitions of a quadratic residue and pseudo-square:
Definition: An integer x in Z mod n is a quadratic residue if (i) gcd⁡x,n=1 and (ii) x=y2modn for some integer y.
Definition: An integer z in Z mod n where n=p⁢q is a pseudo-square if (i) gcd⁡z,n=1, (ii) z is not a quadratic residue in Z mod p, and (iii) z is not a quadratic residue in Z mod q.
The primes p and q are chosen to be of the form p=2⁢s+1 and q=2⁢t+1 where s and t are prime and 2 is a primitive element in both Z mod s and in Z mod t. This choice guarantees that p and q are both congruent to 3 mod 4 (a requirement for the security of the generator) and also that the period of the generator for x0 for any quadratic residue other than 1 is either s−1 or t−1 or lcm⁡s−1,t−1, all of which are large. Random primes p and q, and their product n=p⁢q, satisfying these requirements of lengths 512 bits, 768 bits, and 1024 bits, have been precomputed and the prime factorization discarded (Maple does not have the factorizations). Thus there are three choices for n of lengths 308, 462, and 616 decimal digits, providing a range of security for cryptographic applications.
The following optional arguments are supported. They are input as equations in any order.
range=integer..integer or integer
The range option specifies the range from which the integer is chosen. If a range is given, the returned procedure will generate numbers in this range. If an integer is given, the returned procedure will return integers in the range 0 to value-1. By default the range is 0 to 10^12-1.
The option seed determines the seed for the generator. The value used for x0 must be a "random" quadratic residue which is not equal to 1 (to avoid a short period). The value used for x0 is computed from the value of the seed option. If a seed is not given, a seed is generated by calling RandomTools[MersenneTwister][GenerateInteger] with the argument range = 10^99..10^100.
The RandomTools[BlumBlumShub] module also exports the NewBitGenerator function. This function provides the user with greater control over the properties of the returned procedure. For cryptographic applications, the NewBitGenerator function should be used.
s ≔ 1050109365100103751001961108357097849013652340237134723870:
B ≔ NewGenerator⁡seed=2
B ≔ proclocaln,p;p ≔ proclocali;forifromcby10to40dox ≔ irem⁡x^2,n;z ≔ 1024*z+irem⁡x,1024end do;c ≔ i − 40;iquo⁡z,2^c,'z'end proc;n ≔ p⁡;while1000000000000<=ndon ≔ p⁡end do;nend proc
B ≔ NewGenerator⁡seed=s,range=1..1000:
B ≔ NewGenerator⁡seed=s,range=1020..1030:
Download Help Document
What kind of issue would you like to report? (Optional)