adplus-dvertising
frame-decoration

Question

Which among the following has not been broken yet( still collision free)?

a.

MD-5

b.

SHA-1

c.

DES

d.

SHA-2

Answer: (d).SHA-2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which among the following has not been broken yet( still collision free)?

Similar Questions

Discover Related MCQs

Q. Before the first round of the Whirlpool algorithm, which is the operation that takes place?

Q. How many rounds does the Whirlpool algorithm undergo?

Q. Each round uses a different key in the algorithm.

Q. What is the size of the key in the algorithm?

Q. How many add round key functions are present in the Whirlpool algorithm?

Q. If end to end connection is done at a network or IP level, and if there are N hosts, then what is the number of keys required?

Q. For 1000 nodes in IP level, how many keys would be required?

Q. Communication between end systems is encrypted using a key, often known as

Q. Session keys are transmitted after being encrypted by

Q. For a network with N nodes, how many master keys are present?

Q. PDU stands for

Q. SSM stands for

Q. Which is the last step in establishing a connection between hosts using the SSM?

Q. Larger networks would prefer a full decentralization.

Q. Which of these is not a type of session key?

Q. Which session key is used for electronic funds transfer and point of sale applications?

Q. Sometimes a simple tag is introduced along with the session key. This tag has 8 bits. Which of the following options is wrong?

Q. Hash Value = H = h(CV)
Key Input = Km XOR H
Ciphertext = E([Km XOR H],Ks)
What is CV here?

Q. Which is the correct representation for session key recovery for the plain text?

Q. Which of the following is required to find the session key?

i) Control Vector
ii) Master Key
iii) Encrypted session Key