# Computer Science

Suppose that h is a secure hash that generates an n-bit hash value.

a. What is the expected number of hashes that must be computed to find one collision?

Don't use plagiarized sources. Get Your Custom Essay on
Computer Science
Just from \$13/Page

b. What is the expected number of hashes that must be computed to find 10 collisions? That is, what is the expected number of hashes that must be computed to find pairs (XÌ,ZÌ) with h(xi) = h(zi), fori = 0,1,2,…, 9?

c. What is the expected number of hashes that must be computed to find m collisions?

A fc-way collision is a set of values xo, x\,…, Xk-i that all hash to the same value, that is,

h(x0) = h(xi) = · · · = h(xk-i).

Suppose that h is a secure hash that generates an n-bit hash value.

a. What is the expected number of hashes that must be computed to find one fc-way collision?

b. What is the expected number of hashes that must be computed to find two fc-way collision?

c. What is the expected number of hashes that must be computed to find m distinct fc-way collisions?

Grab A 14% Discount on This Paper
Pages (550 words)
Approximate price: -
Paper format
• 275 words per page
• 12 pt Arial/Times New Roman
• Double line spacing
• Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Try it now!

Total price:
\$0.00

How it works?