I was implementing NTT for long integer multiplication and thus searched for generators of several $Z^{*}_p$ groups where $p=c\cdot 2^k + 1$.
I used the algorithm described in Wikipedia which uses the factorization of (p-1).
Here's a list of what I've found.
I wonder, why are these generators so small even though the prime numbers present are relatively large? Is it a general tendency or does it happen due to the special form of $p$?
Thank you!