18 Aug
2013
18 Aug
'13
6:30 p.m.
correction:
The time consumption here seems to be with fast multiplication about N^2 * logN ops per plaintext bit which for N bit message and key would be N^3 * logN.
--those formulas should have been divided by N.
(And slower if use slow multiplication.) The security level is around N^(1/3) considering NFS integer factoring algorithm.
So... asymptotic-wise, this sucks
--it still sucks in terms of the security vs time tradeoff.