You can access this dialog via the menu entry Individual Procedures \ RSA Cryptosystem \ Generate prime numbers.
Prime numbers are natural numbers greater than 1, which are divisible only by 1 and by themselves, and in cryptography they play an important role. In this demonstration you can generate prime numbers yourself, the prime numbers are generated randomly within freely definable limits.
If you press the Generate prime numbers button, a random search for the prime numbers p and q will be initiated. A number X will be taken at random from the range specified [Lower limit, Upper limit]. The system then "tests" whether X can be a prime number.
For this test random is also necessary:
In this dialog you can choose between the following prime number tests:
If no prime number has been found after trying 1000 randomly drawn numbers X, then an appropriate error message is displayed. In that case you need to raise the range defined by the limits [Lower limit, Upper limit] for the prime numbers accordingly.
Detailed information on the subject of prime numbers will be found in the script.