4 ms·
The article states that SSL encrypted with a 1024 bit RSA key is computationally inexpensive, taking less than 1% of the CPU time on his current web servers. T
by illumin8 16y ago
The article states that SSL encrypted with a 1024 bit RSA key is computationally inexpensive, taking less than 1% of the CPU time on his current web servers. This is correct, however, 1024 bit RSA is no longer considered secure enough. It can be brute forced by modern computing systems.
In fact, the NIST has recommended that all SSL systems be upgraded to 2048 bit keys by January 1st, 2011. This recommendation will have "teeth" for financial institutions that must comply with PCI guidelines, and healthcare that must comply with HIPPA, ARRA, and HITECH regulations.
The problem is that encryption with larger key sizes is computationally much more than 2x expensive. In fact, compute costs are based on a cube of key size, meaning encryption using a 2048 bit private key can be as much as 30x more expensive than 1024 bit.
I agree that website operators should encrypt everywhere, however, encryption with weak keys might be almost as bad as no encryption in the near future, by giving people a false sense of security.
If you are running a serious volume website, you pretty much need SSL accelerators to handle the volume of traffic with 2048 bit encryption. 1-2% CPU load on your web servers can be managed, but 30-60% cannot.
- ars 16y agoThat's an interesting point - as computers get faster at negotiating ssl ciphers, computers also get faster at breaking ssl ciphers. I do hope that the factor on those two numbers is not the same though! So eventually one will win.
- binomial 16y agoI don't know how cryptography works, so I'd like to know why the key length for all cryptography schemes seems to go up in powers of 2. What's the reason one couldn't have a 1300 bit RSA key, for example?
- illumin8 16y agoI don't see any reason why you couldn't. It seems like a 1280 bit key should be secure for at least a few more years.
- evgen 16y agoFast modmults for crypto keys are done using Montgomery multiplication, if the numbers being multiplied are power of two in size the ops are all masks and shifts after the initial transformation.
- wmf 16y agoThe article seems to contradict this: "An abbreviated handshake saves the server performing an RSA operation, but those are cheap anyway." Given that they are performing aggressive session caching, perhaps that 1% is mostly symmetric crypto.
- illumin8 16y agoThe problem is that even if you cache sessions, you still have to do the math to encrypt every packet. Encryption cost is a cube of key size. Please, contradict me. If you can, many cryptographers and mathematicians will thank you... :-) Say what you will, but the difficulty of brute-forcing decryption is based on key length. You might be able to optimize the encryption using a certain length, but the key will still be vulnerable if it is only 1024 bit (as the article suggests).
- lmz 16y agoFor SSL, aren't the individual packets encrypted with a symmetric cypher e.g. AES, RC4, 3DES, etc?
- caf 16y agoYes, the data stream is encrypted using a symmetric cipher, as the linked article says. The overhead of this is trivial. It's the key exchange at the start of a session that requires the server to perform expensive RSA operations, which is why session caching helps.
- spicyj 16y ago> The problem is that encryption with larger key sizes is computationally much more than 2x expensive. In fact, compute costs are based on a cube of key size, meaning encryption using a 2048 bit private key can be as much as 30x more expensive than 1024 bit. How'd you get 30? From what you said, it sounds like it should be 2^3 = 8 times as expensive.
- john_nl 16y agoI'm also curious where the 30x comes from. If cost is indeed the square of key size I would expect: Cost(1024) = (1024*x)^2 Cost(2048) = (2048*x)^2 = (2*1024*x)^2 = 4 * (1024*x)^2 Which is a 4x increase in cost, not 30x.
- illumin8 16y agoCube, not square. Also, implementation matters. 2^3, or 8 times more expensive.
- illumin8 16y ago1024^3 = 1073741824 2048^3 = 8589934592 / 1024^3 = 8. It depends on the implementation. Some implementations are more computationally expensive than others. See: http://devcentral.f5.com/weblogs/macvittie/archive/2010/09/10/f5-friday-the-2048-bit-keys-to-the-kingdom.aspx http://devcentral.f5.com/weblogs/macvittie/archive/2010/09/1... Average of 5x reduction in transactions per second when moving from 1024 bit to 2048 bit keys.