Prime number tools for crypto-bigint

This library implements prime number generation and primality checking for crypto-bigint integers. In particular:

• Generating random primes and safe primes of given bit size;
• Sieving iterator;
• Miller-Rabin test;
• Strong and extra strong Lucas tests, and Lucas-V test.

See the documentation for the specific tests for more information and references.