搜索资源列表
primality
- primality
bigint_zxf
- 一个很好用的大整数的类, 最大可支持9999990位的十进制整数， 可进行大整数的加、减、乘、除和取模运算，并带有求大整数的 最大公因数、扩展Euclidean算法、中国剩余定理算法、 Miller-Rabin素性测试算法、随机生成任意位的大整数等函数库， 这个类的动态库曾用于商业软件之中，其可靠性和速度是得到 确认的。用于商业目的可能需要注册。-a good use of the integer type, the biggest 9999990 to support th
fermat
- 实现素性检测。但不能实现太大的数，只能在小数范围内，而又不能完全确定就是素数，只能粗略估计。-achieve Primality Testing. But too few achieve, only in a minority within, and is not fully ascertained is the prime, only a rough estimate.
素性检测
- 素性检测的Java程序-Primality Testing Java programs
primality
- primality
素性检测
- 素性检测的Java程序-Primality Testing Java programs
bigint_zxf
- 一个很好用的大整数的类, 最大可支持9999990位的十进制整数， 可进行大整数的加、减、乘、除和取模运算，并带有求大整数的 最大公因数、扩展Euclidean算法、中国剩余定理算法、 Miller-Rabin素性测试算法、随机生成任意位的大整数等函数库， 这个类的动态库曾用于商业软件之中，其可靠性和速度是得到 确认的。用于商业目的可能需要注册。-a good use of the integer type, the biggest 9999990 to support th
fermat
- 实现素性检测。但不能实现太大的数，只能在小数范围内，而又不能完全确定就是素数，只能粗略估计。-achieve Primality Testing. But too few achieve, only in a minority within, and is not fully ascertained is the prime, only a rough estimate.
EUCLID
- 本程序完成了欧几里得算法求最大公约数、扩展欧几里得算法求乘法逆元和素性检验判断输入的数是否为素数-This procedure for the completion of the Euclid algorithm for greatest common divisor, extended Euclid algorithm for multiplication and inverse primality test to determine whether the number entered fo
MillerRobin
- 此代码实现的功能主要是做素性判断的MillerRobin测试，用C写的，一起讨论 -This code is mainly to achieve the functions of judge MillerRobin do primality testing, written with C, and discuss
suxingjiance
- VC源码.用于大数检测素性,可用至2048比特的大数-VC source. For primality testing of large numbers can be used to 2048 bits of large numbers
Rabin-Miller
- 素性检验，可用于小数据，大量数据不支持啊，谢谢使用-Primality testing, can be used for small data, a large amount of data does not support ah, thank you to use
sxjc
- 应用加密算法和认证技术 实验：Solovag-Strassen算法、Lehmann算法和Rabin-Miller算法的素性检测的原理与测试过程。-Application of encryption algorithms and authentication technology experiment: Solovag-Strassen algorithm, Lehmann algorithm and Rabin-Miller primality testing algorithm Princip
MillerRabin
- 密码学中的Miller Rabin素性检测算法。人工编写，用这个来学习或者是交作业，绝对是过关利器。-Cryptography Miller Rabin primality testing algorithm. Artificial preparation, use this to learn or交作业is definitely a sharp object boundary.
ss
- 很多密码算法都要随机选择一个大素数，这个是密码学中的MILLER-RABIN算法，判断素性。-Many cryptographic algorithm must randomly select a large prime numbers, this is Cryptography MILLER-RABIN algorithm to determine Primality.
RSA
- 公钥密码算法RSA的加密和解密过程，包括随机数的生成原理和素性检测的内容。-RSA public key cryptography algorithm for encryption and decryption process, including the generation of random number theory and primality testing content.
solovay-strassen-primality-test
- solovay-strassen素性测试法的matlab实现，这也是密码学中的常见算法-solovay-strassen primality test of matlab implementation, which is common cryptography algorithms
Primality-testing
- 使用扩展欧几里得、平方乘等函数对较大的随机数进行素性检测-Primality testing
Primality
- Provides primality probabilistic methods.