I think that a database of the smallest primitive root for lots of
primes would be useful, just to save time. Note that this information
if cached should also be used by the function
multiplicative_generator() for GF(p).
There is certainly no point in listing all of them for a given p! If
g is
If you just recorded the smallest primitive roots I'll bet the database
would get a lot smaller:-) Do you need all the prim roots in the
CrypTool tutorial for a particular purpose, eg discrete logs?
I'd guess a database of the smallest prim roots mod p for all primes
out to a million (for
Most older # theory textbooks (or newer editions thereof) have a list
of smallest primitive roots of p for small p, as well as tables of
indices for index calculus. I'm not sure whether that is quite as
useful now, since any individual discrete log problem might be solved
(slowly) by finding a
