0

I try to find or learn what a division algorithm use NTL(Number Theory Library), and complexity of this algorithm. (need algorithms in GF2X module and ZZ) The implementation of these functions is a lot of code that is difficult to understand what is going in the algorithm.

Has anyone uses NTL? Maybe someone knows standart division and remainder algorithms and their comlexity from number theory and can help?

I can copy-paste listing of some functions.

Ilja Bulatov
  • 63
  • 1
  • 9
  • What functions do you mean exactly? If you mean *everything that has to do with division*, your question is far too broad. – AbcAeffchen Oct 18 '15 at 16:56
  • For example, GF2X lib, rem(GF2X& r, const GF2X& a, const GF2X& b) This func in my case uses void PlainRem(GF2X& r, const GF2X& a, const GF2X& b) The name may be a clue, but very difficult to understand, and the implementation is difficult to calculate its complexity – Ilja Bulatov Oct 19 '15 at 20:05
  • looks like this would be quite a bit of work. I think this can only be done step by step and it will take some hours. Since I don't know the answer yet, I hope someone else will see this. – AbcAeffchen Oct 19 '15 at 20:27

0 Answers0