搜索资源列表
simhash-f624c65.tar
- simhash.c /* Bibliography * Mark Manasse * Microsoft Research Silicon Valley * Finding similar things quickly in large collections * http://research.microsoft.com/research/sv/PageTurner/similarity.htm *
rabin_karp
- An implementation of the Rabin Karp Algorithm to find the longest common sub-sequence between to strings in C.
prime
- RABIN MILLER FOR PRIME
RabinKarp
- code extended algorithm rabin karp
Source-code
- Rabin Miller Program
Bignumber-Miller-Rabin
- 实现大素数判断,通过传统的MillerRabin算法-Achieve large prime number judgment through traditional MillerRabin algorithm
algorithms-master
- 1. 经典的算法实现 2. 服务器端 3. 正确,易于使用和改造, 一个头文件一个算法,并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后,请发起Pull Requests,代码被验证后入库,并在README中发布新算法实现。 已实现 ( Implemented ): Array shuffle Prime test(tr
222
- 随机选择一个12位的整数n,用Miller-Rabin素性检测算法,测试n是否为素数。-A 12 randomly selected integer n, with Miller-Rabin primality testing algorithm, test n is prime.
MillerRabin
- 实验目的 许多密码算法和协议都需要“随机”的大素数,特别是在共享密钥的密码协议中。对于大素数的生成,一个最自然的方法是先生成一个大整数,然后对其进行素性检测。 实验内容与要求 随机选择一个12位的整数n,用Miller-Rabin素性检测算法,测试n是否为素数。 -Purpose of many cryptographic algorithms and protocols need to " random&quo
Millier-Rabin
- 素性测试是不可缺少的一环在安全中,这个程序实现了MR苏醒测试,效率非常高-Primality test is an indispensable link in the security, this program implements wake MR test, the efficiency is very high
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
RSA
- 利用C\C++实现RSA算法的加、解密运算。 具体包括: 1)利用扩展的Euclid计算 a mod n 的乘法逆元; 2)Miller-Rabin素性测试算法对一个给定的大数进行测试; 3)实现的运算,并计算; 4)利用Euler定理手工计算,并与3)计算的结果对比; 5)实现RSA算法。并对 I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS 加
karp-rbin
- 一个简单的karp rabin 算法,可以实现karp rabin算法的一个实例-Karp rabin a simple algorithm that can achieve an instance karp rabin Algorithm
StringMatching
- String Matching Algorithms,Comparisons,Naive string matching algorithm,Rabin-Karp Algorithm, Knuth-Morris-Pratt Algorithm
Rabin_Karp_Algorithm
- Rabin Karp String searching algorithm
miller_rabin
- Miller-Rabin质数测试 输入 第1行:1个正整数t,表示数字的个数,10≤t≤50 第2..t+1行:每行1个正整数,第i+1行表示正整数a[i],2≤a[i]≤10^18 输出 第1..t行:每行1个字符串,若a[i]为质数,第i行输出 Yes ,否则输出 No -Miller-Rabin primality test input The first line: 1 pos
Miller_Prime
- Miller-Rabin 素性检测 能够快速地对一个整数进行素性检测-Miller-Rabin primality testing can be carried out quickly to an integer primality testing
prob3
- Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod
Rabin-2002---AI-Game-Programming-Wisdom
- Learn how AI experts create intelligent game objects and characters with this first volume in the AI Game Programming Wisdom series. This unique collection of articles gives programmers and developers access to the insig
gemhyr
- 这是个很容易且广泛使用的简单算法,它基于Gary Miller的部分象法,有Michael Rabin发展,事实上,这是在()