Which algorithm is used to multiply two arbitrarily large unsigned integers in PARI/GP?

39 Views Asked by At

What is the underlying algorithm that PARI/GP uses to multiply two arbitrary unsigned integers (with arbitrary precision), assuming that all these integers are stored as sequences of N-bit words? I have downloaded the source code, but could not find the answer.