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:

    May my application so close
    To so endless a repetition
    Not make me tired and morose
    And resentful of man’s condition.
    Robert Frost (1874–1963)

    Among a hundred windows shining
    dully in the vast side
    of greater-than-palace number such-and-such
    one burns
    these several years, each night
    as if the room within were aflame.
    Denise Levertov (b. 1923)

    The mind is a finer body, and resumes its functions of feeding, digesting, absorbing, excluding, and generating, in a new and ethereal element. Here, in the brain, is all the process of alimentation repeated, in the acquiring, comparing, digesting, and assimilating of experience. Here again is the mystery of generation repeated.
    Ralph Waldo Emerson (1803–1882)