Addendum. Take a look at Math::Prime::Util. It has an example on how to construct and use a Sophie Germain prime iterator. (Oh, and the wiki link: Diffie–Hellman key exchange.)
In reply to Re^2: How to get good primes for DH agreement ?
by Anonymous Monk
in thread How to get good primes for DH agreement ?
by iglake
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |