搜索资源列表
RSA
- 使用rsa算法进行加密解密与签名验证（使用大素数），基于VC++6.0开发，使用MFC。-Encryption and decryption using the rsa algorithm and the signature verification (using the large prime number), based on VC++6.0 development, using MFC.
Zyz
- 输入一个数 求出该数的质因子 采用先求因子 再判断是否为质数的方法 -Enter a number of prime factors of the number obtained using the first factor and then seek to determine whether the method for the prime number
153ZYH_2
- 编写一个8086/8088汇编程序，它在DOS提示符下运行，从键盘输入一个范围在500－3000的十进制数，而后在DOS窗口输出位于该范围值的所有素数-8086/8088 assembly to write a program that runs under the DOS prompt, from the keyboard to enter a decimal number in the range 500-3000, and then in the DOS window output va
java_sushu
- java利用文本框实现素数的求解，有序输出-java prime number using a text box to achieve the solution
prime_number
- The program makes a decision about the input number. If it is a pirme number, it will try to write it, 2 or 3 prime numbers addition. If it isn t a prime number, the program will end.
2_egyabeces_hely_kesz
- The program makes a decision about the input number. If it is a pirme number, it will try to write it, 2 or 3 prime numbers addition. If it isn t a prime number, the program will end.
primegen-0.97.tar
- This program is a Prime number generator. It generates prime numbers very fast. it uses many algorithms to speed up things and uses cache.
reversible_prime
- 求四位的可逆素数。可逆素数指：一个素数将其各位数字的顺序倒过来构成的反序数也是素数-Find four reversible prime. Reversible primes refer to: a prime number to reverse the order of the digits in reverse order number is composed of prime numbers
prime
- 判断一个数是否是素数，注意，运行环境是 c#.net-To determine whether a number is prime, note that operating environment is c#. Net
nprime
- 给出个数字，输出它前的质数，很好用的，对于小学生来说！-Enter the number to determine whether a prime number, the good, is for the students!
wcp
- 文件中：wcp.exe是我们针对编译实验的文法的一个编译器（不含源码）；pi.txt和prime_number.txt是按照实验文法写的测试程序（前者是求pi值，后者是求质数） 注：wcp将编译和执行放在了一起，而且对原实验文法做了以下扩展 1.标识符采用c语言标准的标识符 2.增加了print语句来打印结果（statement：print VarList ） 执行方法：在cmd下进入wcp所在目录，如 E:\My Learns\编译原理 然后执行如下 E
Miller_Rabin.cpp
- 米勒瑞宾素数测试 大素数测试高效算法 测试一个数是否为素数-Miller Rabin test test whethere it is a prime number
GenBigPrime
- 随机数生成器，可以生成16位或32位的大素数，绝对原创。-Random number generator, can generate 16-bit or 32-bit large prime numbers, is absolutely original.
04
- 编写一个判断一个数字是否是素数的函数，利用该函数求200以内的素数之和。（素数指除了1和它本身之外，该数没有其他因子，例如101就是一个素数。）-Write a judge whether a number is prime function, using the function evaluation within 200 prime numbers. (In addition to a prime number, and it refers to itself, not the number
Pro_bigprim
- 产生固定位长的大素数，可以通过控制台程序产生一个大素数放入一个文件中，同时在屏幕上打印；如果所产生的数较小，可以直接用变量接收的直接打印到屏幕结束。-Have a fixed bit length of the large prime numbers, you can create a console application into a large prime number file, and print on the screen If the resulting number is sm
MillerRabin
- 一种大素数测试源码，对于加密算法中大素数的生成与检测有很大应用。-A large prime number test source code, encryption algorithm for the generation of large prime numbers is very application and detection
RK
- 实验RK算法，即利用Hash方法和素数理论，首先定义一个Hash函数（hash (r) = r mod q），然后将模式串P和文本串T中长度为m的子串利用Hash函数转换成数值。显然只需比较那些与模式串具有相同Hash函数值的子串。 当然因为Hash冲突的存在，还要进一步进行字符串比较，但只要选择适当的素数q, Hash冲突的概率就会很小 -Experimental RK algorithm, namely the use of Hash methods and prime number
01_PrimeNumberFinder
- 这是prime number finder的程序，也就是对质数的判别和寻找。-This is a prime number finder program, which is the identification and finding prime numbers.
work
- find prime number, in C. It is easy way how test your skill and knowledge
function.py
- 使用miller rabin进行素数生成-a prime number generator using miller rabin algorithm