C++ NTL algorithms

Question

Hi there,

I cant seem to find any info on, which algorithms in the NTL C++ libraries are used.

I am especially interested in the algorithms used for:

• Modular square root (SqrRootMod)
• Kernel of matrix over GF(2) (kernel for mat_GF2 objects)
• Greatest common divisor (GCD - this is probably euclids algorithm)
• Modular inverse (InvMod)
• Jacobi symbol (Jacobi)

If anyone can help with this, I am very grateful!

Answer 1

SqrRootMod, InvMod, Jacobi could be found in ZZ.h and ZZ.c. GCD lies in ZZX.h

I believe you can figure everything out by reading the include files in the examples provided on the official website. There are explanations on the algorithms used too.