搜索资源列表
PrimeGeneration.zip
- 得到大素数的算法的Pascal源码
blackeye_elgamalkeygenerator10beta3
- 大素数生成器，根据用户的设置自动生成一个符合要求的大素数，计算速度较快。-large prime number generator, according to the automatic generation to meet the requirements of a large prime numbers, the fast calculation.
素数的判定
- 素数的判定（概率算法），可以判断较大的素数-prime Judgment (probability algorithm), can be judged on a few large
BigIntC
- 一个生成大素数的文件，效率很高。可以在C++或VC++工程里直接引用-generate a large number of paper-and high efficiency. In C or VC works directly invoked Lane
大素数生成
- 大素数生成算法的实现，很不错的一段程序-large prime number generation algorithm to achieve a very good procedures
BigInterger
- C# 实现的大整数类，生成一个伪大素数，大整数之间的运算以及转化成不同编码的输出
大素数生成
- 这是一个利用Java编写的超大素数生成程序！
PrimeNumber.rar
- 大素数生成器，很好用的程序，可以快速的生成，并可以用TXT文档表示出来~,Large prime number generator, a good procedure to use, can be quickly generated, and TXT files that can be used by the ~
prime
- 产生大素数。以时间作为随机数生成的种子，随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
genprime
- 基于大数库miracl的快速产生大素数的c语言实现（输入的随机种子不同产生的大素数也不同）-Based on the rapid creation of large numbers library miracl large prime numbers c-language implementation (a different type of random seed generated large prime numbers are different)
ss
- 很多密码算法都要随机选择一个大素数，这个是密码学中的MILLER-RABIN算法，判断素性。-Many cryptographic algorithm must randomly select a large prime numbers, this is Cryptography MILLER-RABIN algorithm to determine Primality.
1024RSA
- 支持大整数的RSA算法，还可以自动生成随机大素数-Support for large integer RSA algorithm, can also automatically generate random large prime numbers
bigint
- 大素数生成。用于加密解密。具体内容：用C或C++语言编写的一个生成二进制为1024位的大素数的程序。-Generate large prime numbers. For encryption and decryption. Specific elements: using C or C++ Language to prepare a generation of binary for the 1024 program of large prime numbers.
Locksoft
- 文件包括rsa算法原程序及详细注释。可以实现使用1024位以上大素数进行加解密。其中包括大整数的加、减、乘、除、模幂运算，求逆元运算，以及大素数的判定等算法。稍做扩展即可在实际中应用。-Rsa algorithm for the original documents, including procedures and detailed notes. 1024 can be achieved over the use of large prime numbers for encryption an
RSA56778
- 用VC实现的rsa加密解密算法，本人经过测试，可以 直接使用 生成任意多位和任意多个的大素数，十六进制表示 -VC achieved using rsa encryption and decryption algorithm, I tested and can be directly used to generate any number and any number of large prime numbers, hexadecimal
rsa
- 1、编写程序构造一RSA密钥； 2、编写程序实现快速指数算法； 3、编写程序生成大素数； 4、实现RSA密码体制 -1, the preparation of procedures for constructing a RSA key 2, the preparation of procedures for fast index algorithm 3, the preparation process to generate large prime numbers 4, t
BigPrimerGen
- 大数的运算的类和大素数生成的算法，用C++实现。-Big number computing and big primer generating algorithm.
RSA.ZIP
- 产生大素数，进行任何位的RSA加密解密，进行大整数的进制转换，进行大整数的加法和乘法运算。-Generate large prime numbers, any bit RSA encryption and decryption, binary large integer conversion, large integer addition and multiplication.
素数判断
- 生成大素数,利用了时间随机种子。并且用Miller_Rabin测试法，判定素数(Generating large prime numbers takes advantage of temporal random seeds. And the Miller_Rabin test is used to determine the prime number)
素数
- 判断素数的几大方法之一，比较实用，能快速判断素数(One of the major ways to determine prime numbers is more practical, which can quickly determine prime numbers.)