¡@

Home 

c++ Programming Glossary: modpow

Fast bignum square computation

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

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

modular arithmetics and NTT (finite field DFT) optimizations

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

modsub DWORD a DWORD b DWORD modmul DWORD a DWORD b DWORD modpow DWORD a DWORD b void fourier_NTT NTT DWORD dst DWORD src.. L 0x01000000 n 28 25 bit N n size of vectors DWORDs W modpow r L Wn for NTT iW modpow r p 1 L Wn for INTT rN modpow n p 2.. bit N n size of vectors DWORDs W modpow r L Wn for NTT iW modpow r p 1 L Wn for INTT rN modpow n p 2 scale for INTT return true..