搜索资源列表
shanks
- 求离散对数的shanks算法，要求如下： 实现计算 Zp 中计算离散对数的 Shanks 算法，基本要求如下： 1）p 是一个小素数( 小于 32 bit )，a 是一个本原元。程序的输入为(p, a, b), 输出为 logab ( mod p) (可以用 log3525 (mod 809)等作为测试)； 2）采用快速模指数算法求幂（如am），采用扩展欧几里得算法求逆（ 如a-i (mod p) ）； 3）采用
AlgoritmRabina_Karpa
- The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text. For text of length n and p pattern
5_16
- Miller-Rabin素性测试算法的C语言实现-Miller-Rabin primality testing algorithm of C language
Miller_Rabin.cpp
- 米勒瑞宾素数测试 大素数测试高效算法 测试一个数是否为素数-Miller Rabin test test whethere it is a prime number
kaixin
- Rabin-Karp alg http://www.truecrypt.org/
RSAaRabin
- 其中包含介绍RSA和rabin的ppt文档。可用于学习此算法，尤其对于素数检测的学习与应用有帮助。-Which contains the descr iption of the RSA and rabin ppt documents. The algorithm can be used for learning, especially for prime testing and application of learning help.
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.
MillerRabin()
- 素性检测的miller-rabin算法-Primality testing
pollard-rho__miller-rabin
- pollard_rho 产生某数的随机因子 && miller_rabin 素数测试 acm数论算法 poj1811 ac代码-pollard_rho & miller_rabin the num_theory algorithm of ACM the accept source code of poj1811
andrew-tytula-2002.pdf
- Detailed information about Information Dispersal Algorithms based on Rabin s algorithms.
EfficientIDA_Rabin.pdf
- Rabin s paper in Information Dispersal Algorithms.
miller
- 64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解 -64 within the Rabin-Miller strong pseudo-primes test and Pollard rho factorization
cv
- i have attached the source codes of diffie hellman key exchange,rsa algorithm,elgamal client server algorithm,miller - rabin algorithm .
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 wa
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
testkr
- Karp Rabin , Some algorithm in Information Retrieval. Visual C++.NET 2003
vvvqinxue
- 应用lucas定理 对小素数进行判定，这种方法同Miller-Rabin概率检测法相似-prime detect
main.cpp
- 素数测试 miller rabin 提高算法 随机版 算法导论Introduction of Algorithms-Primes test of Miller_Rabin Algorithm Introduction of Algorithms
sushu
- 素数的判定，miller-rabin，sol-str,leman,fermat等。都可以运行，下完自后自己稍微改改就可以用。-Primes judgment, miller-rabin, sol-str, leman, fermat so on. Can run is finished after their own little changed since it can be used.