Hot answers tagged


From this answer: The difficulty of factoring (thus, as far as we know, the security of RSA in the absence of side-channel and padding attacks) grows smoothly with $n$. So, if factoring is the method of choice for breaking RSA, it doesn't seem like it really helps.


How does one verify a key revocation? As Jon Callas already stated: you simply don’t. In case a different wording helps, here’s a quote related to the exact same question… … On 02/19/2014 11:55 AM, Hauke Laging wrote: Am Di 18.02.2014, 23:19:33 schrieb Tadas ...

Only top voted, non community-wiki answers of a minimum length are eligible