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)
“Black lady,
what will I do
without your two flowers?
I have inhabited you, number by number.
I have pushed you in and out like a needle.”
—Anne Sexton (1928–1974)
“If you think about it seriously, all the questions about the soul and the immortality of the soul and paradise and hell are at bottom only a way of seeing this very simple fact: that every action of ours is passed on to others according to its value, of good or evil, it passes from father to son, from one generation to the next, in a perpetual movement.”
—Antonio Gramsci (1891–1937)