A collision-resistant hash function

Assignment Help Basic Computer Science

Reference no: EM13760145

1. 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 messages x, x' with x o x', we have H(x) o H(x')? Explain your answer.
2. Perform encryption and decryption using the RSA algorithm (Figure 3.10) for the following: p = 11; q = 13; e = 11; M= 7. Make sure you show both the resulting ciphertext and plaintext equations for encryption and decryption, respectively. Show your work! )
3. Consider a Diffie-Hellman scheme with a common prime q = 11 and a primitive root a = 2.
a. If user A has public key YA = 9, what is A's private key XA? Show your work!
b. If user B has public key YB = 3, what is the shared secret key K? Show your work!
4. Consider a one-way authentication technique based on asymmetric encryption:
A 4 B: /DA
B 4 A: E(P U., R2)
A 4 B: R2
a. Explain the protocol.
b. What type of attack is this protocol susceptible to? (5 points)
5. Is it possible in SSL for the receiver to reorder SSL record blocks that arrive out of order? If so, explain how it can be done. If not, why not? (2 points)

Reference no: EM13760145

Questions Cloud

Privatize the money supply in the united states : Would it be possible to privatize the money supply in the United States completely? In doing so, what would be the primary obstacle to overcome in implementing such a policy?

Examination and treatment for emergency medical conditions : Review pages 109-110 of Essentials of Health Policy and Law as well as the following legislation: Examination and Treatment for Emergency Medical Conditions and Women in Labor

The calculator should display the amount of commission : The calculator should display the amount of commission (in dollars), based on the amount of sales entered and the commission rate selected and the total annual compensation.

Create a student database in ruby : To create a student database in Ruby that allows for, updating a record within the database

A collision-resistant hash function : 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 messages x, x' with x o x', we have H(x) o H(x')? Explain your answer.2. Perform encryption and decrypt..

Algorithm for checking whether a list of integers is sorted : Consider the obvious algorithm for checking whether a list of integers is sorted: start at the beginning of the list, and scan along until we first find a successive pair of elements that is out of order.

Open directory project : Browse the subject categories in the Open Directory Project (do NOT use the search engine) to find the name of the student newspaper for Mt. Hood Community College in Oregon.

Heath care organisations : The various components of the selected health care system

Split tunnel technology over other types of vpn technologies : Explain what is meant by "split tunnel" VPNs. Explain the purpose of using this technology over other types of VPN technologies. From a security perspective, analyze how a remote user using split-tunneling to gain access to the corporate network ..

User Account

All Pages