Make a deterministic prime generator

[dsroche]

When using deterministic algorithms, it may be useful to generate primes deterministically with a given bit length. This would also allow for some optimizations such as precomputing a small list of primes of various bit lengths, to avoid the cost of primality checks when not needed.

[ClementPernet]

first naive versionn done in #96. Letting this issue open as a reminder to consider using precomputed lists of primes

[bdsaunders]

Do we have a prime (irreducible) generator for F[x] as well? ...I would use it. Deterministic and/or not.

On Thu, Dec 21, 2017 at 11:59 AM, Clément Pernet notifications@github.com wrote:

first naive versionn done in #96 https://github.com/linbox-team/linbox/pull/96. Letting this issue open as a reminder to consider using precomputed lists of primes

— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/linbox-team/linbox/issues/71#issuecomment-353402513, or mute the thread https://github.com/notifications/unsubscribe-auth/ADk6I1Ita4_3WXz9xJMgyd_OEwCqT8r3ks5tCo6AgaJpZM4PtwCz .

[ClementPernet]

We should, but I see very little advantage of having both prime integers and irreducible polynomials sharing the same class. There would be too many features specific to each one:

• bit size vs degree
• bitsize and degree for irreducible integer polynomials,
• additional requirement that the irreducible polynomial is primitive,
• etc