¡@

Home 

c++ Programming Glossary: intt

Fast bignum square computation

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

2^16 Bytes 2^14 DWORDs 16384 DWORDs sqr use only 1xNTT 1xINTT insted of 2xNTT 1xINTT for multiplication NTT usage is too slow.. 16384 DWORDs sqr use only 1xNTT 1xINTT insted of 2xNTT 1xINTT for multiplication NTT usage is too slow and the treshold number.. n convolution for i 0 i n i yy i modmul yy i yy i ntt.p INTT ntt.INTT xx yy suma q 0 for i 0 j 0 i n i qq xx i q qq 0xFF..

modular arithmetics and NTT (finite field DFT) optimizations

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

DWORD src DWORD n 0 DWORD dst n fast NTT DWORD src n void INTT DWORD dst DWORD src DWORD n 0 DWORD dst n fast INTT DWORD src.. void INTT DWORD dst DWORD src DWORD n 0 DWORD dst n fast INTT DWORD src n helper functions bool init DWORD n init r L p.. src DWORD n DWORD w DWORD dst n slow NTT DWORD src n void INTT_slow DWORD dst DWORD src DWORD n DWORD w DWORD dst n slow INTT..

Coroutine demo source

http://stackoverflow.com/questions/3330838/coroutine-demo-source

time.h #include math.h #include stdlib.h template class intT intT log2 intT input return intT log10 double input log10 2.0.. #include math.h #include stdlib.h template class intT intT log2 intT input return intT log10 double input log10 2.0 template.. math.h #include stdlib.h template class intT intT log2 intT input return intT log10 double input log10 2.0 template class..