Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Generalized Fermat prime"”.
-
Putting Fürer's Algorithm into Practice with the BPAS Library
… into practice for multiplying polynomials over a prime field Z/pZ, which characteristic is a Generalized Fermat prime of the form p = r^k + 1 where k is a power of 2 and r is of machine word size. When k is at least 8, we show that multiplication inside such a prime field can be efficiently …