资源列表
[CA认证] 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<jitender grover> 在 2025-11-24 上传 | 大小：1kb | 下载：0
[CA认证] 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<jitender grover> 在 2025-11-24 上传 | 大小：1kb | 下载：0
[CA认证] 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<jitender grover> 在 2025-11-24 上传 | 大小：1kb | 下载：0
[CA认证] 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,<jitender grover> 在 2025-11-24 上传 | 大小：1kb | 下载：0
[CA认证] 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<jitender grover> 在 2025-11-24 上传 | 大小：1kb | 下载：0