搜索资源列表
miller
- 对Miller-Rabin算法的进一步改进,速度约为0.4秒验证一个素数(CPU为赛扬1.5G) //本程序使用Miller Rabin方法计算1024位素数（2进制）
Miller-Rabin_primality_test_(Java)
- Miller-Rabin Prime Number Test
Rabin-Miller.rar
- 1.Rabin-Miller算法的素性检测的原理与测试过程。 2. 有算法流程，用程序设计语言将算法过程编程实现。 3. 对输入的随机数，选择素性检测算法进行素性检测。 ,1.Rabin-Miller primality testing algorithm principle and the testing process. 2. There are algorithms process programming language with the process of programm
ss
- 很多密码算法都要随机选择一个大素数，这个是密码学中的MILLER-RABIN算法，判断素性。-Many cryptographic algorithm must randomly select a large prime numbers, this is Cryptography MILLER-RABIN algorithm to determine Primality.
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
MillerRabin
- 密码学中的Miller Rabin素性检测算法。人工编写，用这个来学习或者是交作业，绝对是过关利器。-Cryptography Miller Rabin primality testing algorithm. Artificial preparation, use this to learn or交作业is definitely a sharp object boundary.
xm1099
- Miller-Rabin随机性素数测试，能有效的判断一个小于2^63次方的数是不是素数。-Miller-Rabin prime randomness tests, can effectively determine whether a power of less than 2 ^ 63 is the number of prime numbers.
MillerRabin
- Miller rabin素性检测算法源代码-Miller R
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
MillerR
- Miller-Rabin test for simple numbers.
Miller-Rabin
- Miller-Rabin算法 随机算法 求素数-Miller-Rabin Ramdom Algorithm
Miller-Rabin
- 用Witness2实现Miller-Rabin算法，主程序循环5—20次，看在100,000—200,000之间有多少个数被判为素数-With the Miller-Rabin algorithm to achieve Witness2, the main program loop 5-20 times, to see how many in number between 100,000-200,000 convicted of prime
Miller-Rabin_primality_test_(Java)
- Miller rabin primality test
MillerRabin
- Miller Rabin素数测试，可以在O（1）时间复杂度内测试大素数，使用随机化思想-Miller Rabin prime test
Miller-Rabin
- 用C语言编的，密码学基础中的Miller-Rabin。-In the basis of the C language, cryptography Miller-Rabin
miller-rabin
- this miller rabin source code-this is miller rabin source code
Miller-Rabin_primality_test_(Java)
- 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.
Miller-Rabin
- 基本的MILLER-RABIN算法,是密码学学生的基本知识！-Basic Miller-Rabin algorithm is the basic knowledge of cryptography students!
miller-rabin
- miller-rabin素性检测算法，信息安全安全数学基础适用。-miller-rabin primality testing algorithm.
Miller-Rabin
- Miller-Rabin源代码，自己写的密码学作业-Miller-Rabin sources