Re:Socat: “the hard coded 1024 bit DH p parameter was not pr...
by qwerty1793 on Monday February 01, 2016 @09:57PM
(#11017411)
The following Sage script shows that p has no prime factors less than 2^32 other than 271 and 13597:
[ Parent
| on HN ]
Re:Socat: “the hard coded 1024 bit DH p parameter was not pr...
by williamstein on Tuesday February 02, 2016 @08:55AM
(#11019393)
Sage also has an is_prime function, which provably show that p is not prime: "is_prime(p)". This takes less than 1ms to run. Proving primality of a 1024 bit prime in Sage takes a few seconds, and for a 2048 bit prime about a minute. Sage uses PARI for this, with sophisticated elliptic curve based algorithms called ECPP("=elliptic curve primality proving"), which are non-deterministic (unlike AKS) but fast in practice and provably correct. https://goo.gl/34uxJl