kenneds6 / SafePrimeTimingTest

How long does is take to find a safe prime over 150 digits long on your machine? This safe prime test just uses the fermat test for primality testing but one can see that finding large safe primes is time consuming, hence why some cut corners and do not generate new safe primes each time, instead use the add two method.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

This repository is not active

About

How long does is take to find a safe prime over 150 digits long on your machine? This safe prime test just uses the fermat test for primality testing but one can see that finding large safe primes is time consuming, hence why some cut corners and do not generate new safe primes each time, instead use the add two method.


Languages

Language:Java 94.3%Language:HTML 5.7%