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 main object of a revolution is the liberation of man ... not the interpretation and application of some transcendental ideology.”
—Jean Genet (1910–1986)
“There is not to be found, in all history, any miracle attested by a sufficient number of men, of such unquestioned good sense, education, and learning, as to secure us against all delusion in themselves ... beyond all suspicion of any design to deceive others ... and at the same time attesting facts, performed in such a public manner, and in so celebrated a part of the world, as to render the detection unavoidable.”
—David Hume (1711–1776)
“By this unprincipled facility of changing the state as often, and as much, and in as many ways as there are floating fancies or fashions, the whole chain and continuity of the commonwealth would be broken. No one generation could link with the other. Men would become little better than the flies of a summer.”
—Edmund Burke (1729–1797)