Generates a sequence of t bits using the RSA pseudo-random bit generator with an RSA modulus of approximately b bits in length. The modulus n is computed by finding (pseudo-)random primes with the RandomPrime function. If gcd(φ(n), 3) is 1, then the exponent 3 will be used. Otherwise, a (pseudo-)random exponent e is chosen so that gcd( φ(n), e)=1. The seed is also chosen as a (pseudo-)random number modulo n. Bits are represented as elements of GF(2).
> Z := Integers(); > &+[ Z | b : b in RandomSequenceRSA(100, 1000) ]; 497
Generates a sequence of t bits using the RSA pseudo-random bit generator with modulus n, exponent e, and seed value s. Bits are represented as elements from GF(2). The integer n must be larger than 1.
Returns an RSA Modulus n of b bits in length, and an exponent e such that Gcd(EulerPhi(n),e)=1. The resulting values can be used to generate random bits with the function RandomSequenceRSA. The argument b must be at least 16. Warning: RSA Moduli generated by Magma should not be used for real world cryptographic applications. Such applications require a "true random" source to seed the random number generator. Magma's method of seeding may not be sufficiently random to meet the requirements of cryptographic standards.
Returns an RSA Modulus n of b bits in length such that Gcd(EulerPhi(n),e)=1. The resulting value can be used with e for the exponent to generate random bits with the function RandomSequenceRSA. The argument b must be at least 16. The argument e must be odd and must also be in the range 1 < e < 2b. Warning: RSA Moduli generated by Magma should not be used for real world cryptographic applications. Such applications require a "true random" source to seed the random number generator. Magma's method of seeding may not be sufficiently random to meet the requirements of cryptographic standards.
Generates a sequence of t bits using the Blum-Blum-Shub pseudo-random bit generator with a Blum-Blum-Shub modulus of approximately b bits in length. The modulus n is computed within Magma by finding (pseudo-)random primes with the RandomPrime function (the condition being that the primes are congruent to 3 mod 4). The seed is chosen as a (pseudo-)random number modulo n. Bits are represented as elements from GF(2). b must be at least 16.
Generates a sequence of t bits using the Blum-Blum-Shub pseudo-random bit generator with modulus n and seed value s. Bits are represented as elements from GF(2). The argument n must be larger than 1 and gcd(s, n) must be 1.
Returns a Blum-Blum-Shub Modulus b bits in length. The resulting value can be used to generate random bits with the function RandomSequenceBlumBlumShub. The argument b must be at least 16. Warning: Blum-Blum-Shub Moduli generated by Magma should not be used for real world cryptographic applications. Such applications require a "true random" source to seed the random number generator. Magma's method of seeding may not be sufficiently random to meet the requirements of cryptographic standards.[Next][Prev] [Right] [Left] [Up] [Index] [Root]