搜索资源列表
isprime
- 判断是不是大素数,的快速算法,适用于公钥加密算法-judgment is not large prime numbers, the fast algorithm applicable to the public key encryption algorithm
5365212977
- 素数生成算法，用于生成公共密钥，CA分配公共密钥。-prime number generation algorithm used to generate the public key, CA public key distribution.
moni-momi
- 2的16次幂正整数d与n，编写计算d-1 (mod n) 的程序； 2、对于三个不超过2的16次幂正整数a、e与n，编写计算ae (mod n) 的程序。 在上述程序基础上写出下列程序： （1） 对给定的10000以内数判定其是否为素数； （2） 进行ElGamal体制的加密与签名。 -two of 16 power-positive integer d and n, calculate the preparation of d-1 (mod n); 2. For not m
7_Rsa
- RSA公钥加密算法基于大整数因式分解困难这样的事实。 选择两个素数，p，q。（一般p,q选择很大的数） 然后计算 z=p*q f=(p-1)(q-1) 选择一个n，使gcd(n,f)=1（gcd代表greatest common divider,一般n也选择一个素数）， n和z就作为公钥。 选择一个s,0<s<f,满足n*s ％ f=1，s就作为私钥。-RSA public key encryption algorithm based on the integer fa
RsakitT
- RSA算法,大素数生成,加密解密-RSA algorithm, generating large prime numbers, encryption and decryption
大素数生成
- 大素数生成算法的实现，很不错的一段程序-large prime number generation algorithm to achieve a very good procedures
Rsa1Kit_V1.0
- RSA的小程序，源码产生随机素数调用方法：N.GetPrime(bits)返回值：N被赋值为一个bits位（0x100000000进制长度）的素数-RSA small program source random-number call methods : N. GetPrime (bits) Returns : N has been assigned a bits - (0x100000000 band length) of prime numbers
RSA解密和加密算法的实现和应用
- RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a,
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, Chinese Remainder Theorem RSA de
poj1811
- 程序实现了大素数的判断和如果不是素数，则其可分解的最小的素数-program of large prime numbers and if the judgment is not prime, then decomposition of the smallest prime number
RsaTool.自己写的RSA算法工具
- 自己写的RSA算法工具。支持RSA密钥产生（包括CRT）、RSA运算、强素数生成、大数运算等功能。用了的都说好。,Writing their own tools of the RSA algorithm. Support for RSA Key Generation [including CRT], RSA computation, strong prime number generation, large numbers computing functions. Use of that goo
PrimeGenAndTester
- Very large (tested for more than 2048 bits) prime number generator and tester program. This is well written and based on solid algorithms in this field. Source code is my own, used for Masters course in Cryptography. Program has easily readable and
PRIME
- 在密码学中判断一个数是否为素数很重要 该算法判断一个数是否为素数 c语言实现-Cryptography judged in a number of prime numbers is very important for the algorithm to determine whether a number of prime numbers c language
generate_RSA_n
- 生成大素数并检验以及生成RSA1024位公钥子程序，不使用库文件，源代码公开，清晰有注释-Generate large prime numbers and testing, and to generate RSA1024-bit public key subroutine, do not use library files, source code is open, clear and annotated
prime
- RABIN MILLER FOR PRIME
Cryptanalysis-of-Multi-Prime-RSA
- Cryptanalysis of Multi-Prime RSA
prime
- 由小素数构造大素数的程序,由于知道大素数的分解形式,可求原根!(A program that constructs a large prime number from a small prime number)
prime
- How to find prime numbers
prime_fnc
- how to find prime numbers using function
prime_std
- how to find prime numbers using std