搜索资源列表
MillerRabin
- Miller rabin素性检测算法源代码-Miller R
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.
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