Re:Socat: “the hard coded 1024 bit DH p parameter was not pr...
by pbsd on Monday February 01, 2016 @04:59PM
(#11015850)
I am not familiar with all the ways the GRH can be disproven, but Miller-Rabin doesn't strike me as the most efficient, with its running time of O((log n)^4) for each attempt. I am not sufficiently competent to say whether a GRH counterexample also directly results in a MR counterexample.
[ Parent
| on HN ]
There are no comments on this comment yet.