The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
Which of following is true ?

A. A secure hash function can never produce any collisions.

B. Cryptographic function is deterministic

C. Host using DHCP on wired network can be prevented against DHCP spoofing attacks.

D. None
asked in Computer Networks by Loyal (7k points) | 22 views

From Wiki:- 

A cryptographic hash function should behave as much as possible like a random function while still being deterministic and efficiently computable. A cryptographic hash function is considered "insecure" from a cryptographic point of view, if either of the following is computationally feasible:

  1. Finding a (previously unseen) message that matches a given hash values.
  2. Finding "collisions", in which two different messages have the same hash value.

An attacker who can find any of the above computations can use them to substitute an authorized message with an unauthorized one.


My doubt is can the above points 1 and 2 ever occur ?

Please log in or register to answer this question.

Related questions

+1 vote
1 answer
asked Jun 4, 2016 in Algorithms by Don't you worry Active (1.6k points) | 113 views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

42,699 questions
48,662 answers
63,970 users