Computer Science, asked by nivedithahl, 4 months ago

Suppose that H is a secure hash function that generates N bits hash value, what is

the expected number of hash must be computed to find one collision?

Answers

Answered by khaaleahjones

0

Answer:

The number of collisions (assuming that the harsh function can be modeled as a random function) so it would count as three collisions.

Explanation:

Previous Question

Next Question

Similar questions

Hindi, 2 months ago

फल वाले और ग्राहक के बीच हुआ संवाद लिखो...

Science, 2 months ago

what is the difference between electric motor and dynamo..

History, 2 months ago

the God was the focus of worship ...

English, 4 months ago

13. How many players are their in Basketball a4 b10...

English, 4 months ago

Q U E S T I ON How is the process of pollination different from fertilisation?

English, 10 months ago

Read the following conversation carefully and complete the following passage by choosing the most appropriate options. Dilip: I’ve been watching the sea and there hasn’t been any trace of a ship Ralph: I told you yesterday too that we’ll be rescued, so have patience. Dilip: why do you ask me to keep quiet whenever I say something? Ralph: have you ever said anything sensible? Dilip said (a)...

Social Sciences, 10 months ago

जनसंख्या के वितरण को प्रभावित करने वाले किन्हीं दो कारकों की विवेचना कीजिए...

Social Sciences, 10 months ago

निम्नलिखित में से कौन एक विकसित देश नहीं है (अ) नार्वे (ब) ब्राजील (ग) कनाडा (घ) फ्रांस...