2 ms·
Don't you need insanely high numbers before Karatsuba outperforms the simple O(n^2) algorithm? From Wikipedia: > As a rule of thumb, Karatsuba's method is usua
by BeetleB 6y ago
Don't you need insanely high numbers before Karatsuba outperforms the simple O(n^2) algorithm? From Wikipedia:
> As a rule of thumb, Karatsuba's method is usually faster when the multiplicands are longer than 320–640 bits
- moonchild 6y ago4096-bit keys are standard for RSA, for example.