All Questions
Tagged with birthday hash-function
7
questions
0
votes
0
answers
25
views
Expected number of collsions in hashing
Suppose we use a hash function h to hash n keys into m slots. Assuming simple uniform hashing, what is the expected number of collisions? (CLRS, 3rd edition, problem 11.2-1)
My solution is as follows:
...
2
votes
1
answer
136
views
What is the expectation value of the minimum 'distance' between two random 64-bit numbers out of a set of N?
Assume we have a set of N random integer numbers in the interval [0, 2^64> (or equivalent, consider N randomly chosen corners (vectors) of a 64-dimensional ...
0
votes
0
answers
226
views
Probability distribution for collisions / birthday problem
Let's say I have a source of randomly produced values from a range $M$. I want to test if the source is a uniform distribution by examining a sample sequence of $n$ values $m_1, m_2,\dots,m_n$. ...
1
vote
2
answers
72
views
Probability of distribution using a discrete random function
Problem:
Given P persons (say 1000) distribued among N rooms (say 50) using a discrete random distribution function.
What would be the probability of a room having at least K persons (say 30 or more ...
1
vote
1
answer
47
views
Days required to collide at least one hash? [closed]
Sorry I am new here and learning mathematics and cryptographic problems.
Assume an hash algorithm is collision resistant like SHA256, and the hash value is 64bit in length, (2^{64} possibilities)
...
1
vote
1
answer
790
views
Calculating probability of no hash collision
Given a 64-bit hash function that takes arbitrary inputs, what is the probability that feeding 10 million inputs into the hash function will outputs 10 million unique outputs. I've came up with this:
$...
4
votes
3
answers
2k
views
Birthday Problem applied to collisions
I'm trying to extend the birthday problem to detect collision probability in a hashing scheme. Here is my problem. I use the letters and numbers [A-Z][a-z][0-9] to make a set of keys by randomly ...