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)
“Hence, a generative grammar must be a system of rules that can iterate to generate an indefinitely large number of structures. This system of rules can be analyzed into the three major components of a generative grammar: the syntactic, phonological, and semantic components.”
—Noam Chomsky (b. 1928)
“Most women of [the WW II] generation have but one image of good motherhood—the one their mothers embodied. . . . Anything done “for the sake of the children” justified, even ennobled the mother’s role. Motherhood was tantamount to martyrdom during that unique era when children were gods. Those who appeared to put their own needs first were castigated and shunned—the ultimate damnation for a gender trained to be wholly dependent on the acceptance and praise of others.”
—Melinda M. Marshall (20th century)