Sophie Germain Prime - Application in (pseudo-)random Number Generation

Application in (pseudo-)random Number Generation

Sophie Germain primes have a practical application in the generation of pseudo-random numbers. The decimal expansion of 1/q will produce a stream of q − 1 pseudo-random digits, if q is the safe prime of a Sophie Germain prime p, with p congruent to 3, 9, or 11 (mod 20). Thus “suitable” prime numbers q are 7, 23, 47, 59, 167, 179, etc. (corresponding to p = 3, 11, 23, 29, 83, 89, etc.). The result is a stream of length q − 1 digits (including leading zeros). So, for example, using q = 23 generates the pseudo-random digits 0, 4, 3, 4, 7, 8, 2, 6, 0, 8, 6, 9, 5, 6, 5, 2, 1, 7, 3, 9, 1, 3. Note that these digits are not appropriate for cryptographic purposes, as the value of each can be derived from its predecessor in the digit-stream.

Read more about this topic:  Sophie Germain Prime

Famous quotes containing the words application, number and/or generation:

    “There are very few things impossible in themselves; and we do not want means to conquer difficulties so much as application and resolution in the use of means.”
    —François, Duc De La Rochefoucauld (1613–1680)

    “Without claiming superiority of intellectual over visual understanding, one is nevertheless bound to admit that the cinema allows a number of æsthetic-intellectual means of perception to remain unexercised which cannot but lead to a weakening of judgment.”
    —Johan Huizinga (1872–1945)

    “The women of my mother’s generation had, in the main, only one decision to make about their lives: who they would marry. From that, so much else followed: where they would live, in what sort of conditions, whether they would be happy or sad or, so often, a bit of both. There were roles and there were rules.”
    —Anna Quindlen (20th century)