资源列表
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
4
- Cryptographic Hash Functions: A cryptographic hash function must have at least two security properties: collision free and Hiding. Collision free property ensures that for a given function H, no one can find x and y such that H(x) = H(y). The hid
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
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,
q1
- Consider an organization with three roles: A, B and C. Whenever B has to issue some instruction to A, B has to take permission via C and then only it will be obeyed by A. This permission is issued with the help of a digital signature. A verifies
mbedtls-2.4.0-apache
- mbed-tls加密库源码，arm收购自polarssl-Mbed-tls encrypt library source code, polarssl has been sold to ARM and renamed.
des.tar
- THE ALGORITHM WRITTEN IN C FOR BOTH ENCRYPTION AND DESCRYPTION AND CAN BE USED AS SINGLE MODULE FOR 3- des ALGORITHM
Hill-Cipher
- Encryption algorithm of Hill cipher with GUI in c#
AES-Assignment-1.3
- AES algorithm implementation in c# with GUI
RSA-Assignment-2.1
- RSA algorithm implementation in c# using GUI
LL-encryption
- 图像加密代码，可以利用混沌理论对灰度图像加密和解密。-Image encryption code, you can use chaotic theory to grayscale image encryption and decryption
free-hex-editor-neo
- hex editor to break hex code of software which are written in hex.