Showing 3 open source projects for "miller rabin"

View related business solutions
  • Passwordless Authentication and Passwordless Security Icon
    Passwordless Authentication and Passwordless Security

    Identity is everything. Protect it with Duo.

    It’s no secret — passwords can be a real headache, both for the people who use them and the people who manage them. Over time, we’ve created hundreds of passwords, it’s easy to lose track of them and they’re easily compromised. Fortunately, passwordless authentication is becoming a feasible reality for many businesses. Duo can help you get there.
    Get a Free Trial
  • Build Securely on AWS with Proven Frameworks Icon
    Build Securely on AWS with Proven Frameworks

    Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

    Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
    Download Now
  • 1

    64-bit prime test

    Test 64-bit integers for pribality. Miller-Rabin, Lucas. BPSW

    The code here tests 64-bit integers for primality. For 32-bit values it uses hashing and then a single Miller-Rabin test. As values get larger it uses up to two more Miller Rabin rounds, and at the end it uses BPSW (which is one rould of Miller Rabin and then one of Lucas). Compared to other codes that achieve the same I believe that the hash tables used here are compact, and both the programs and the intermediate data used to create them are provided. This may be of interest just to people...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    Photon4K

    32768-bit symmetric-key encryption, fully-functional development CLI

    ... quantum and conventional computing resources reported on often by the mainstream tech press. Unlike more simple algorithms, Photon4K leverages multiple layers of randomization techniques including: - Static random data (256KB) - Static random prime data (32,768 64bit primes) - Numerous iterations of randomization - Blum-Blum-Shub generated pseudorandom data - Miller-Rabin [Probabilistic] Primality Test on very large pseudorandom generated integers - Scratch-written BigInteger Library
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Implementation of the Miller-Rabin prime number test in Java
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.