9.13
Consider the following scheme:
1.Pick an odd number,
E.
2.Pick two prime numbers,
P
and
Q, where (P
-1)(Q
-1)-1 is evenly divisible by
E.
3.Multiply
P
and
Q
to get
N.
4.Calculate
D=
{(P-1)(Q
-1)(E-1)+1}/e
Is this scheme equivalent to RSA? Show why or why not
11.6
Suppose H(m) is a collision-resistant hash function that maps a message of arbitrary bit length into an
n-bit hash value. Is it true that, for all messagesx,
x' withx?x,x1
we haveH(x) ?H(x') Explain your answer
9.3
In a public-key system using RSA, you intercept the ciphertext
c=10 sent to a user whose public key is
e
=5,
n
=35. What is the plaintext
M?
Document Preview:
9.13 Consider the following scheme: 1. Pick an odd number, E. 2. Pick two prime numbers, P and Q, where (P - 1)(Q - 1) -1 is evenly divisible by E. 3. Multiply P and Q to get N. 4. Calculate D = {(P - 1)(Q - 1)(E - 1) + 1}/e Is this scheme equivalent to RSA? Show why or why not 11.6 Suppose H(m) is a collision-resistant hash function that maps a message of arbitrary bit length into an n-bit hash value. Is it true that, for all messagesx, x' withx ? x,x1 we have H(x) ? H(x') Explain your answer 9.3 In a public-key system using RSA, you intercept the ciphertext c= 10 sent to a user whose public key is e = 5, n = 35. What is the plaintext M?
9.13 Consider the following scheme: 1. Pick an odd number, E. 2. Pick two prime numbers, P and Q, where (P - 1)(Q - 1) -1 is evenly divisible by E. 3. Multiply P and Q to get N. 4. Calculate D = {(P - 1)(Q - 1)(E - 1) + 1}/e Is this scheme equivalent to RSA? Show why or why not 11.6 Suppose H(m) is a collision-resistant hash function that maps a message of arbitrary bit length into an n-bit hash value. Is it true that, for all messagesx, x' withx ≠ x,x1 we have H(x) ≠ H(x') Explain your answer 9.3 In a public-key system using RSA, you intercept the ciphertext c= 10 sent to a user whose public key is e = 5, n = 35. What is the plaintext M?