文件名称:PrimeGenAndTester
介绍说明－－下载内容均来自于网络，请自行研究使用
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.
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.
相关搜索： Miller
Rabin
java
algorithm
rabin
Rabin
Miller
cryptography
blum
blum
shub
blum
blum
shub
prime
generator
cryptography
miller
rabin
Rabin
java
algorithm
rabin
Rabin
Miller
cryptography
blum
blum
shub
blum
blum
shub
prime
generator
cryptography
miller
rabin
(系统自动生成,下载前可以参看下载内容)
下载文件列表
bin\BBSRandomNumGen.class
...\inputfile1
...\inputfile2
...\MillerRabinPrimeTester.class
...\ModularNumber.class
...\outputfile
...\PrimeGenAndTester.class
...\RandSupport.class
...\SolovayStrassenPrimeTester.class
bin
src\BBSRandomNumGen.java
...\MillerRabinPrimeTester.java
...\ModularNumber.java
...\PrimeGenAndTester.java
...\RandSupport.java
...\SolovayStrassenPrimeTester.java
src
.project
.classpath
...\inputfile1
...\inputfile2
...\MillerRabinPrimeTester.class
...\ModularNumber.class
...\outputfile
...\PrimeGenAndTester.class
...\RandSupport.class
...\SolovayStrassenPrimeTester.class
bin
src\BBSRandomNumGen.java
...\MillerRabinPrimeTester.java
...\ModularNumber.java
...\PrimeGenAndTester.java
...\RandSupport.java
...\SolovayStrassenPrimeTester.java
src
.project
.classpath