Earlier quoted context omitted.
> People generally talk about speed of encryption and decryption. You're complaining about time for bruit-force attacks. If it takes me k time to decrypt something where there are N key variations and where I can run p attempts in parallel, the maximum runtime for a brute force attack is k*N/p. Perfectly linear relationship. This is why we want large key spaces, and why algorithms needing offline brute force protecti…
> This is why we want large key spaces, This is a subset of what I'm talking about. Encryption/decryption times aren't linear with key space sizes. Force the number of required parallel instances to exceed the number of atoms on Earth, and bruit force time rapidly diverges from being linear with encryption/decryption time.
Re: Schnorr confirms paper is his, claims it “destroys RSA cryptosystem”
#81Nit: It's spelled "brute." "Bruit" is a rumor.