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:
“The application requisite to the duties of the office I hold [governor of Virginia] is so excessive, and the execution of them after all so imperfect, that I have determined to retire from it at the close of the present campaign.”
—Thomas Jefferson (1743–1826)
“I am walking over hot coals suspended over a deep pit at the bottom of which are a large number of vipers baring their fangs.”
—John Major (b. 1943)
“The language of the younger generation ... has the brutality of the city and an assertion of threatening power at hand, not to come. It is military, theatrical, and at its most coherent probably a lasting repudiation of empty courtesy and bureaucratic euphemism.”
—Elizabeth Hardwick (b. 1916)