Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Faster prime generation #6

Merged
merged 2 commits into from
Oct 21, 2024
Merged

Faster prime generation #6

merged 2 commits into from
Oct 21, 2024

Commits on Oct 20, 2024

  1. MultiplicativeGroupAlgebra.CreateCryptoGroup skips more known non-pri… 

    …me candidates.

Sophie Germain primes can only have a value of 5 modulo 6, which is used to improve the prime finding algorithm in MultiplicativeGroupAlgebra.CreateCryptoGroup, which previously was checking every odd number.
This reduces the number of primality tests that are performed by up to 2/3.

Also joins the previously separate test cases into a single implementation and fixes a bug in which the rng mock was
not returning the expected bytes.
    @lumip
    lumip committed Oct 20, 2024
    Configuration menu
    Copy the full SHA
    bca9457 View commit details
    Browse the repository at this point in the history

Commits on Oct 21, 2024

  1. Added RandomNumberGeneratorExtensions.GetBigPrime

    @lumip
    lumip committed Oct 21, 2024
    Configuration menu
    Copy the full SHA
    383738e View commit details
    Browse the repository at this point in the history