[理工] hash function (probability)
102交大 計算機系統 第6題
The ideal one way hash function is collision free. Given y=h(x).
Suppose x is of infinite length and y is of 8 bits.
What is the probability that two different inputs, x and x', of the hash function collide?
Ans.2/256=1/128
原因為何?
矛盾:y=h(x)為collision free, x and x'不同,怎麼可能產生collide?
機率應該為0?
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 220.138.218.240
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1421897099.A.DF0.html
推
01/22 11:55, , 1F
01/22 11:55, 1F
→
01/22 11:55, , 2F
01/22 11:55, 2F
→
01/22 11:55, , 3F
01/22 11:55, 3F
→
01/22 11:55, , 4F
01/22 11:55, 4F
→
01/22 12:14, , 5F
01/22 12:14, 5F
→
01/22 12:15, , 6F
01/22 12:15, 6F
→
01/22 12:39, , 7F
01/22 12:39, 7F
→
01/22 13:55, , 8F
01/22 13:55, 8F