¡@

Home 

c++ Programming Glossary: modadd

Fast bignum square computation

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

of modular arithmetics on unsigned integers modpow modmul modadd modsub i use DWORD 32bit unsigned integer numbers NTT input..

modular arithmetics and NTT (finite field DFT) optimizations

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

shr DWORD a modular arithmetics DWORD mod DWORD a DWORD modadd DWORD a DWORD b DWORD modsub DWORD a DWORD b DWORD modmul DWORD.. i n2 i j w2 modmul w2 w a0 src i a1 modmul src j w2 dst i modadd a0 a1 dst j modsub a0 a1 void fourier_NTT NTT_slow DWORD.. wi a n2 n 1 for wj 1 j 0 j n j a 0 for wi 1 i 0 i n i a modadd a modmul wi src i wi modmul wi wj dst j a wj modmul wj w ..