GQQ Primality Test
A fast and deterministic primality test.
Time complexity:O(ln n)2.
Input the length of the strong prime number, plen, and the auxiliary prime number, palen, palens=palen1+palen2, and quantities of the strong prime number you need.
for asking to find strong prime numbers, and separate them with ",".
If palen or/and palens are 0, or none, the strong primes are generated in accordance with
the National Institute of Standards and Technology of the Department of Commerce USA.
The length of strong prime number must be ingeter from 40 to 2048.
The quantity of strong prime number must be under 10.