搜索资源列表
Rabin-Miller
- 素性检验，可用于小数据，大量数据不支持啊，谢谢使用
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
RSAUpper
- 这是个很容易且广泛使用的简单算法，它基于Gary Miller的部分象法，有Michael Rabin发展。事实上，这是在NIST的DSS建议中推荐的算法的一个简化版。 首先选择一个代测的随机数p，计算b，b是2整除p-1的次数。然后计算m，使得n=1+(2^b)m。-This is a very easy and simple and widely used algorithm, which is based on some of Gary Miller as the law, ther
Miller-Rabin
- Miller-Rabin算法 随机算法 求素数-Miller-Rabin Ramdom Algorithm
suxingjiance
- 素性检测，利用三种方法： Solovag-Strassen检测，Lehmam检测， Rabin-Miller检测-Primality testing, using three methods: Solovag-Strassen Detection, Lehmam testing, Rabin-Miller Detection
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
5_16
- Miller-Rabin素性测试算法的C语言实现-Miller-Rabin primality testing algorithm of C language
function.py
- 使用miller rabin进行素数生成-a prime number generator using miller rabin algorithm
ml
- Miller rabin. This is implementation of miller rabin to find if the given no. is prime or composite.
RSA-example
- 大二的时候写的RSA类头文件，集成了大数四则运算、幂模运算、米勒罗宾算法寻找大数等RSA加密必须的算法，详询《密码学原理与实践》-Sophomore writing the RSA class header file, integrated Tarsus four computing power modular arithmetic, Miller-Rabin algorithm must find large numbers RSA encryption algorithm, detailed
vvvqinxue
- 应用lucas定理 对小素数进行判定，这种方法同Miller-Rabin概率检测法相似-prime detect
Bignumber-Miller-Rabin
- 实现大素数判断，通过传统的MillerRabin算法-Achieve large prime number judgment through traditional MillerRabin algorithm
miller-rabin
- miller-rabin素性检测算法，信息安全安全数学基础适用。-miller-rabin primality testing algorithm.
MillerRabin
- 实验目的 许多密码算法和协议都需要“随机”的大素数，特别是在共享密钥的密码协议中。对于大素数的生成，一个最自然的方法是先生成一个大整数，然后对其进行素性检测。 实验内容与要求 随机选择一个12位的整数n，用Miller-Rabin素性检测算法，测试n是否为素数。 -Purpose of many cryptographic algorithms and protocols need to " random" large prime numbers, partic
fermat_test.py
- Fermat primality test. most applications use a Miller-Rabin or Baillie-PSW test for primality. Sometimes a Fermat test (along with some trial division by small primes) is performed first to improve performance. GMP since version 3.0 uses a base-210 F