Note that log(n) is the length of the prime, so if you are using 2048 bit primes...

yorwba on May 18, 2018 | parent | context | favorite | on: An Interesting Pattern in the Prime Numbers: Paral...

Note that log(n) is the length of the prime, so if you are using 2048 bit primes, log⁶(n) is quite large. I don't think anyone actually uses one of the general deterministic primality testing algorithms in cryptographic applications.