搜索资源列表
jj
- CORNACCHIA Algorithm * * GOAL: given d and p prime, find (x,y) such that x^2 + y^2 = d * p * * in this implementation, d = 1. This code does not accept d <> 1 !!! * see "A Course in Computational Algebraic Number Theory" by Henri
rsa.tar
- rsa algorithm .... works fine for 1024 bit prime numbers
BigPrime
- 本程序是用C语言编写的RSA大素数密码生成体制-It is a program for 啊large prime number of RSA
RSA
- 公钥密码对文件加密或者解密，对素数判断采用工业概率判断-Public key encryption or decryption of the file on the prime determine the probability of judging by industry
BigIn-lib
- 高效的素数解决方案。可以用解决大数的素数输出-Efficient prime solution. Can be used to solve large numbers of prime output
Fermat
- Fermats test to check for primality. Code is in java. takes a e=random number and gives whether it is prime or not.
RSA-prime-number
- RSA的实现，内含有一个大素数类，很实用。-The realization of RSA, contains a large prime number class, very practical.
Elgamal
- ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two rando
RSA
- RSA算法基于一个十分简单的数论事实：将两个大素数相乘十分容易，但那时想要对其乘积进行因式分解却极其困难，因此可以将乘积公开作为加密密钥-RSA algorithm is based on a very simple fact of number theory: multiplying two large prime numbers is very easy, but then want their factoring product is extremely difficult, so the
rsa
- RSA algorithm including long integer type, some test algorithm, large prime number generator and the general theory of numbers algorithm
prob3
- Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to
discrete_log
- Solve descrete log problem using meet in the middle attack. More formally, write a program to compute discrete log modulo a prime p. Let g be some element in Z p and suppose you are given h in Z p such that h = gx where 1 ≤ x ≤ 240. Your goal