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:
“If you would be a favourite of your king, address yourself to his weaknesses. An application to his reason will seldom prove very successful.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“The Oregon [matter] and the annexation of Texas are now all- important to the security and future peace and prosperity of our union, and I hope there are a sufficient number of pure American democrats to carry into effect the annexation of Texas and [extension of] our laws over Oregon. No temporizing policy or all is lost.”
—Andrew Jackson (1767–1845)
“... if women once learn to be something themselves, that the only way to teach is to be fine and shining examples, we will have in one generation the most remarkable and glorious children.”
—Brenda Ueland (1891–1985)