[Cryptography] DH non-prime kills "socat" command security

[Ray Dillinger]

Well crap. The fermat test got this on the first iteration.

Before we worry about provable primes, we can implement much simpler
probabilistic primality tests that clients can use to at least try to
disprove primality.  This particular number yields instantly to every
probabilistic primality test that's been tried on it as far as I can
tell.

And honestly there's been no case ever of a nonprime discovered that
fools both the Fermat test and Maurer's algorithm for 100 iterations,
and at least in the civilian world as far as I know nobody has any
idea how to find one.

				Bear

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: OpenPGP digital signature
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20160205/f64c2ac7/attachment.sig>