News for hackers. Stuff that matters.

A comment on How hard can generating 1024-bit primes be?. Parent comment

Re:How hard can generating 1024-bit primes be? by pbsd on Saturday May 04, 2024 @04:05PM (#40259943)
The best asymptotic bound is somewhere between n^(1/8sqrt(e) + eps) and n^(1/6.568sqrt(e) + eps), per [1].

[1] https://doi.org/10.1007/BFb0030409

[ Parent | on HN ]

There are no comments on this comment yet.