Skip to content

Comment on Overclocking SSLparent

Comments

Complexity of breaking (presumably, prime factorisation in the case of RSA) is exponential wrt key size, whereas encryption has polynomial complexity. We'll be fine.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.