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:
““Five o’clock tea” is a phrase our “rude forefathers,” even of the last generation, would scarcely have understood, so completely is it a thing of to-day; and yet, so rapid is the March of the Mind, it has already risen into a national institution, and rivals, in its universal application to all ranks and ages, and as a specific for “all the ills that flesh is heir to,” the glorious Magna Charta.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“One may confidently assert that when thirty thousand men fight a pitched battle against an equal number of troops, there are about twenty thousand on each side with the pox.”
—Voltaire [François Marie Arouet] (1694–1778)
“One generation plants the trees under which another takes its ease.”
—Chinese proverb.