Description: Very large (tested for more than 2048 bits) prime number generator and tester program. This is well written and based on solid algorithms in this field. Source code is my own, used for Masters course in Cryptography.
Program has easily readable and well written algorithm implementation to check for Jacobian Symbol, choice of two methods for primality testing: Miller-Rabin or Solovay-Strassen method and Blum-Blum Shub method for random number generation.
Input and output of the program is through files in \bin directory. Project is compatible with Java Eclipse 3.0 IDE, but can also be easily built from command line.-Very large (tested for more than 2048 bits) prime number generator and tester program. This is well written and based on solid algorithms in this field. Source code is my own, used for Masters course in Cryptography.
Program has easily readable and well written algorithm implementation to check for Jacobian Symbol, choice of two methods for primality testing: Miller-Rabin or Solovay-Strassen method and Blum-Blum Shub method for random number generation.
Input and output of the program is through files in \bin directory. Project is compatible with Java Eclipse 3.0 IDE, but can also be easily built from command line.
Platform: |
Size: 22528 |
Author:s_wilfred |
Hits:
Description: Miller Rabin:Just like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true for prime values, then checks whether or not they hold for a number that we want to test for primality. Platform: |
Size: 2048 |
Author:deitel10 |
Hits:
Search - Miller Rabin java