That sounds a little underspecified. Primality proofs for given-sized primes are O(1), otherwise have to scale with size?
I mean "doesn't scale linearly with size." I.e. can we precompute some values that allow us to very quickly re-verify primality?
-
-
In particular right now crypto libs generally don't check primality when loading an RSA key b/c it is too slow. Trying to fix that.
-
My idea is that I will try to add an extension to PKCS#8 for RSA that allows primality test to be done "fast enough" when present.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.