c++ Programming Glossary: karatsuba

http://stackoverflow.com/questions/18465326/fast-bignum-square-computation

of Karatsuba multiplication thanks to Calpis i implemented karatsuba multiplication but the results are massively slower even than.. have some silly mistake in code . Anyway after solving karatsuba for case x x there is not much performance gain. edit2 optimized.. is not much performance gain. edit2 optimized code for karatsuba implementation void arbnum _mul_karatsuba DWORD z DWORD..

modular arithmetics and NTT (finite field DFT) optimizations

http://stackoverflow.com/questions/18577076/modular-arithmetics-and-ntt-finite-field-dft-optimizations

720.419 ms NTT sqr mul1 5.588 ms simpe mul mul2 3.172 ms karatsuba mul mul3 1053.382 ms NTT mul some measurements after my optimizations.. 208.298 ms NTT sqr mul1 5.564 ms simpe mul mul2 3.113 ms karatsuba mul mul3 302.740 ms NTT mul check the NTT mul and NTT sqr times.. more than 40x times now is NTT multiplication faster than karatsuba after about 1500 32bits treshold. btw speed of my NTT is now..