Computer Science, asked by nivedithahl, 3 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

English, 1 month ago

manager said to employee "why you came late to office" reported speech...

Math, 1 month ago

द सम ऑफ एंगल of triangless is...

Physics, 1 month ago

Vector A() makes an angle of 45° with the x-axis. Given the magnitude of vector A to be 5 m, calculate the x- & y- components of vector A.

English, 3 months ago

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

English, 3 months ago

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

English, 8 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, 8 months ago

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

Social Sciences, 8 months ago

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