搜索资源列表
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
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
- prime value found in this c code
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
- 孪生素数, 起讲的相邻的素数（且必须素数）。用不同的父子进程打印-the sister of prime date ,it s work on linux system.the main proecess is vcc.hello
prime
- unix下通过创建多线程计算质数的优化算法-unix calculate prime numbers by creating a multi-threaded optimization algorithm
RSA-prime-number
- RSA的实现，内含有一个大素数类，很实用。-The realization of RSA, contains a large prime number class, very practical.
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
prime
- sequence prime number