搜索资源列表
bigmod
- This preview for Phill s Big Mod shows the addition of proper SUR files into the mod
RSA_algo
- this RSA algorithm which run for 1024 bits data. which have inner fuction like multiplicatin,addition,mod,power,subtaction , greater,less,equal etc .all opetaion for 1024 bit data. -this is RSA algorithm which run for 1024 bits data. which have inn
BASE64
- BASE64解码 VBS源代码 Function fDecode(sStringToDecode) Const CharList = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" Dim iDataLength, sOutputString, iGroupInitialCharacter sStringToDecode = Replace(Replace(Replace(sSt
attachments_2013_05_05
- To find mod of a number used in crypt app.
456
- RSA算法的C语言实现 1.密钥的产生 (1)选两个安全的大素数p和q。 (2)计算n=p×q，φ(n)=(p-1)(q-1)，其中φ(n)是n的欧拉函数值。 (3)选一整数e，满足1<e<φ(n)，且gcd(φ(n),e)=1。 (4)计算d，满足de≡1 modφ(n)，即d是e在模φ(n)下的乘法逆元，因e与φ(n)互素，由模运算可知，它的乘法逆元一定存在。 (5)以{e,n}为公开钥，{d,n}为秘密钥。 2.加密 加密时首先将明文M比特串分组
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
diffeehellmanPROGRAM
- Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the answer. A handy standard no
RC4-Prog
- Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the answer. A handy standard no
Yush.java.tar
- This a new algorithm in which we encrypt on the basis of position of the character. Algorithm 1 for key generation and Algorithm 2 is for encryption Algorithm A1 Step1: Let the key be ‘k’. Step2: Multiply the index number +1 with its ASCII c
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
diffie_hellman
- Implement Diffie-Hellman Key exchange protocol and demonstrate that at the end, both person will have a common Key. Do the following: 1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5). 2. Generate a, a random number mod p. Now generate A,