q1.rar - 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 the credibility of the
message using C s public key (and digital signature), like any other digital signature
scheme.,2017-05-01 21:28:54,下载2次
diffie_hellman.rar - 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, which is g raised to
the a power mod p i.e. A = (ga) mod p .
3. Do the step 2 for b and B.
4. A and B are public keys. Generate a session key with them set s1 to B raised
to the a power mod p so s1 = (Ba) mod p.
5. Do the step 4 with A and b i.e. (Ab) mod p = s2.
6. check the correctness i.e. check whether you came up with the s1 == s2.
(b) Write a program to demonstrate the man in the middle attack is possible using
an example. You can perform set up as described in the above problem.,2017-05-01 21:26:11,下载2次
discrete_log.rar - 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 is to find x. More precisely, the input to your program is p,g,h
and the output is x.,2017-05-01 21:24:50,下载1次
4.rar - 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 hiding
Property encures that Given H(x), it is infeasible to find x.,2017-05-01 21:22:55,下载1次
prob3.rar - 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 answer each of the below questions.
(a) Given a positive integer N, check whether it is prime or not.
1-1• Input: N
• Output: Prime or Not
• For example, Input: 31
• Output: prime
(b) Given a positive integer N, find the smallest prime greater than N.
• Input: N
• Output: M
• Example: Input: 25
• Output: 29
(c) For a composite number, N = 221 (13 ×17), Miller-Rabin test outputs N = 221
as ‘prime’ for a = 174. Such a are known as strong liars. Find all other strong
liars for the N = 221. Similarly, for a = 137 , it shows that N = 221 is composite. Such a’s are known as strong witness of compositeness. Find other strong
witnesses if any.,2017-05-01 21:19:46,下载1次
AKS.rar - Implement AKS algorithm for primality testing, which was the
first polynomial time primality test that was devised. Read the paper attached and
implement the main algorithm. Implement for numbers of size max 64 bits. Bonus
marks will be given, if implemented for larger numbers using Library for big integers.
You can use C/C++ for it. Note for purposes of checking, print out the polynomial,
you get in the for loop each time, of the main algorithm(Step 5). And mainly print
out the answer, YES or NO for the primality,2017-05-01 18:40:33,下载1次
20162313.rar - SQL Engine and Parser made in C++. It can take simple sql commands and shows the results the tables given in the folder with metadata file. Runs in Linux.,2017-02-14 22:25:05,下载1次
SPIN_Matlab.rar - Matlab code of SPIN Routing Protocol in Wireless Sensor Network,2013-09-17 15:16:57,下载146次
mainnetjune2013.zip - it is a pdf file format that is uploaded,2013-03-20 14:33:15,下载2次