Q. Which algorithm has the most execution latency?

View solution

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

View solution

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

View solution

Q. How many rounds does the Whirlpool algorithm undergo?

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

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

View solution

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

View solution

Q. Session keys are transmitted after being encrypted by

View solution

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

View solution

Q. PDU stands for

View solution

Q. SSM stands for

View solution

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

View solution

Q. Larger networks would prefer a full decentralization.

View solution

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

View solution

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

View solution

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

View solution

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

View solution