Prime Generation and Primality Testing

An implementation of algorithms for prime generation and primality testing:

• Miller-Rabin

Licensing

• BUSL-1.1
• Commercial licensing is available

Copyright

Copyright (c) Jeffrey Hohenstein jeffrey.hohenstein@gmail.com

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you shall be licensed as above, without any additional terms or conditions.

References

• 1 Katz, Jonathan, and Yehuda Lindell. Introduction to Modern Cryptography. 3rd ed. New York: Chapman and Hall/CRC, 2020. https://doi.org/10.1201/9781351133036.
• 2 RustCrypto

lib.rs:

Miller Rabin Composite Test

This test offers a probabilistic test for whether a (potentially) large number is composite.