3 ms·
This isn't intuitive to me. Isn't RSA actually more difficult to break with quantum computing than comparable ecc key strengths, simply due to the larger amount
by Valodim 3y ago
This isn't intuitive to me. Isn't RSA actually more difficult to break with quantum computing than comparable ecc key strengths, simply due to the larger amount of data involved?
Put differently, I assumed that factorization of a 3072 bit number has a higher security margin than discrete logarithm on a 256 bit point on a curve. Is that not so?
- NooneAtAll3 3y agogiven that in either case it's a polynomial scaling, difference in a couple years between both isn't that important
- deleted 3y ago[deleted]