The cryptographic relevance of this problem will become evident when we cover hash functions in class. For each question below, provide a brief explanation and a compact formula for your answer. Let n be a positive integer. Consider an experiment involving a group of participants, where we assign each participant a number that is randomly chosen from the set {1,2,...,n} (so all these assignments are independent events). Note that we allow for the possibility of assigning the same number to two different participants. Now pick your favourite number N between 1 and n. When any one of the participants is assigned the number N, we refer to this as a weak collision (with N). In this problem, we determine how to ensure at least a 50% chance of a weak collision in our experiment. a. What is the probability that a given participant is assigned your favourite number N? b. What is the probability that a given participant is not assigned the number N? c. Suppose k people participate in the experiment (for some positive integer k). What is the probability that none of them is assigned the number N, i.e. that there is no weak collision?
The cryptographic relevance of this problem will become evident when we cover hash functions in class. For each question below, provide a brief explanation and a compact formula for your answer. Let n be a positive integer. Consider an experiment involving a group of participants, where we assign each participant a number that is randomly chosen from the set {1,2,...,n} (so all these assignments are independent events). Note that we allow for the possibility of assigning the same number to two different participants. Now pick your favourite number N between 1 and n. When any one of the participants is assigned the number N, we refer to this as a weak collision (with N). In this problem, we determine how to ensure at least a 50% chance of a weak collision in our experiment. a. What is the probability that a given participant is assigned your favourite number N? b. What is the probability that a given participant is not assigned the number N? c. Suppose k people participate in the experiment (for some positive integer k). What is the probability that none of them is assigned the number N, i.e. that there is no weak collision?
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Transcribed Image Text:Problem 3 Weak collisions
The cryptographic relevance of this problem will become evident when we cover hash functions in
class.
For each question below, provide a brief explanation and a compact formula for your answer.
Let n be a positive integer. Consider an experiment involving a group of participants, where we
assign each participant a number that is randomly chosen from the set {1,2,...,n} (so all these
assignments are independent events). Note that we allow for the possibility of assigning the same
number to two different participants.
Now pick your favourite number N between 1 and n. When any one of the participants is assigned
the number N, we refer to this as a weak collision (with N). In this problem, we determine how
to ensure at least a 50% chance of a weak collision in our experiment.
b.
a. What is the probability that a given participant is assigned your favourite number N?
What is the probability that a given participant is not assigned the number N?
c. Suppose k people participate in the experiment (for some positive integer k). What is
the probability that none of them is assigned the number N, i.e. that there is no weak collision?
d. Suppose again that k people participate in the experiment (for some positive integer
k). What is the probability that at least one of them is assigned the number N, i.e. that a weak
collision occurs?
e. Intuitively, the more people participate, the likelier we encounter a weak collision.
We wish to find the minimum number K of participants required to ensure at least a 50%
chance of a weak collision.
Suppose n = 12. What is the threshold K in this case? Give a numerical value that is an
integer.
f. Generalizing part (e) from n = 12 to arbitrary n, prove that if the number of
participants is at least log(2)n≈ 0.69n (where "log" refers to the natural logarithm), then
there is a better than 50% chance of a weak collision. Use (without proof) the inequality
1-x<e¯¤ for x > 0.
(3)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
