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:

    “We will not be imposed upon by this vast application of forces. We believe that most things will have to be accomplished still by the application called Industry. We are rather pleased, after all, to consider the small private, but both constant and accumulated, force which stands behind every spade in the field. This it is that makes the valleys shine, and the deserts really bloom.”
    —Henry David Thoreau (1817–1862)

    “In the U.S. for instance, the value of a homemaker’s productive work has been imputed mostly when she was maimed or killed and insurance companies and/or the courts had to calculate the amount to pay her family in damages. Even at that, the rates were mostly pink collar and the big number was attributed to the husband’s pain and suffering.”
    —Gloria Steinem (20th century)

    “Counting is the religion of this generation it is its hope and its salvation.”
    —Gertrude Stein (1874–1946)