CSE 598 Week 2 Quiz: Hash Functions
Due Oct 23, 2022 at 11:59pm
Points 10
Questions 8
Available after Oct 10, 2022 at 12am
Time Limit 60 Minutes
Attempt History
Attempt Time Score Regraded
LATEST Attempt 1 less than 1 minute 10 out of 10 10 out of 10
Score for this quiz: 10 out of 10
Submitted Oct 23, 2022 at 8:37pm
This attempt took less than 1 minute.
Question 1
Original Score: pts Regraded Score: pts
1. For a 512-bit hash function, the attacker needs to compute how many hash operations in order to
find two matching outputs?
Correct!
1.158 x1077
1.340 ×10¹⁵⁴
3.403 ×10³⁸
2.895 x10⁷⁶
Question 2
pts
2. Suppose you have Eight data points — 1 to 8. The post-order traversal of the Merkle Tree is given by
(here 8 means hash of 8, 43 means the combined hash of 4 and 3, and so on)
{8, 7, 87, 6, 5, 65, 8764, 4, 3, 43, 2, 1, 21, 4321, 87654321}
{8, 87, 7, 8764, 6, 65, 5, 87654321, 4, 43, 3, 4321, 2, 21, 1} Correct!
{1, 2, 12, 3, 4, 34, 1234, 5, 6, 56, 7, 8, 78, 5678, 12345678}
{87654321, 8765, 87, 8, 7, 65, 6, 5, 4321, 43, 4, 3, 21, 2, 1}
Question 3
pts