搜索资源列表
大素数生成
- 大素数生成算法的实现，很不错的一段程序-large prime number generation algorithm to achieve a very good procedures
大素数生成
- 大素数生成算法的实现，很不错的一段程序-large prime number generation algorithm to achieve a very good procedures
RSAVC
- RSA算法的VC实现，其中包括超长整数类，素数检验算法，大素数生成器和一般的数论算法，例如中国剩余定理解密RSA密文-RSA algorithm VC, including long integer type, in a few test algorithm, large prime number generator and the general theory of numbers algorithm, for example, Ch
poj1811
- 程序实现了大素数的判断和如果不是素数，则其可分解的最小的素数-program of large prime numbers and if the judgment is not prime, then decomposition of the smallest prime number
blackeye_elgamalkeygenerator10beta3
- 大素数生成器，根据用户的设置自动生成一个符合要求的大素数，计算速度较快。-large prime number generator, according to the automatic generation to meet the requirements of a large prime numbers, the fast calculation.
BigIntC
- 一个生成大素数的文件，效率很高。可以在C++或VC++工程里直接引用-generate a large number of paper-and high efficiency. In C or VC works directly invoked Lane
isprime
- 判断是不是大素数,的快速算法,适用于公钥加密算法-judgment is not large prime numbers, the fast algorithm applicable to the public key encryption algorithm
RsakitT
- RSA算法,大素数生成,加密解密-RSA algorithm, generating large prime numbers, encryption and decryption
resource_code_of_RSA
- 文件包括RSA算法原程序及详细注释。可以实现使用1024位以上大素数进行加解密。其中包括大整数的加、减、乘、除、模幂运算，求逆元运算，以及大素数的判定等算法。稍做扩展即可在实际中应用。-Documents include the RSA algorithm for the original procedures and detailed notes. Can be achieved using more than 1024 large
bigint_computation_tool
- RSA的应用需要用到很多大素数。如何生成大素数，将成为是否能实现RSA的关键技术。-Application of RSA requires a lot of large prime numbers. How to generate large prime numbers, will become the target of RSA key technologies.
RSAprimeteach
- RSA原码，仅供密码学爱好者学习使用，可以帮助大家了解RSA的加密原理，同时也可以学会大素数产生算法-RSA original code, only to learn the use of cryptography enthusiasts can help you understand the principles of RSA encryption, but also can learn to generate large prime
SUSHU
- 本原码能实现大一定大素数的检测，希望对大家有用！-Primitive code can realize a certain detection of large prime numbers, I hope useful for all of us!
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 p
ss
- 很多密码算法都要随机选择一个大素数，这个是密码学中的MILLER-RABIN算法，判断素性。-Many cryptographic algorithm must randomly select a large prime numbers, this is Cryptography MILLER-RABIN algorithm to determine Primality.
PrimeNumber
- 大素数生成器，很好用的程序，可以快速的生成，并可以用TXT文档表示出来~-Large prime number generator, a good procedure to use, can be quickly generated, and TXT files that can be used by the ~
Locksoft
- 文件包括rsa算法原程序及详细注释。可以实现使用1024位以上大素数进行加解密。其中包括大整数的加、减、乘、除、模幂运算，求逆元运算，以及大素数的判定等算法。稍做扩展即可在实际中应用。-Rsa algorithm for the original documents, including procedures and detailed notes. 1024 can be achieved over the use of large p
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, hexadeci
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 gene
prime
- 产生大素数。以时间作为随机数生成的种子，随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
素数判断
- 生成大素数,利用了时间随机种子。并且用Miller_Rabin测试法，判定素数(Generating large prime numbers takes advantage of temporal random seeds. And the Miller_Rabin test is used to determine the prime number)