Welcome to our brand new Clickteam Community Hub! We hope you will enjoy using the new features, which we will be further expanding in the coming months.

A few features including Passport are unavailable initially whilst we monitor stability of the new platform, we hope to bring these online very soon. Small issues will crop up following the import from our old system, including some message formatting, translation accuracy and other things.

Thank you for your patience whilst we've worked on this and we look forward to more exciting community developments soon!

  • Please login to see this picture.

    [color:#666666]Blum Blum Shub (B.B.S.) is a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub (Blum et al., 1986).
    More on: Please login to see this link.

    A pseudorandom number generator is an algorithm for generating a sequence of numbers that approximates the properties of random numbers.

    prime1 and prime2 are two prime numbers which should be both congruent to 3 modulo 4.

    In our case this means that prime1-3 sould be divisible by 4, and (47-3)/4 = 11 so it’s divisible, and prime2-3 should be divisible by 4, and (67-3)/4 = 16 so it’s divisible.

    This means The two primes, p and q, should both be congruent to 3 (mod 4) (this guarantees that each quadratic residue has one square root which is also a quadratic residue) and gcd(?(p-1), ?(q-1)) should be small (this makes the cycle length large).

    Also, the greatest common divisor of prime1-1 and prime2-1 should be a small number, and that is since the greatest common divisor of 46 and 66 is 2.

    xi, also called “seed”, should be an integer different than 1.[/color]

    Please login to see this link.

Participate now!

Don’t have an account yet? Register yourself now and be a part of our community!