From Jacob Bernoulli to Modern Cryptography
Main content
Speaker: Igor Semaev (The Selmer Center, UoB)
Abstract: Let n shots be allocated into N boxes according to a probability distribution on boxes. Equivalently, n balls are randomly drawn from an urn with balls of N different colors, where the fraction of balls of each color define a distribution on colors. This convenient model to study probability theory was mentioned by Jacob Bernoulli in Ars Conjectandi published in 1713.
The number of boxes with exactly r shots (in particular, the number of empty boxes), the number of shots before all N boxes are occupied(coupon collector's problem) etc. are among the most attractive problems to study. The model has applications in statistics, statistical mechanics, genetics.
Cryptography aims to provide information security with ciphers, hash functions, digital signatures etc.
In this talk, I will explain why random allocations are there useful. Any special knowledge of the above scientific disciplines is not necessary for understanding the presentation.
About the speaker: Igor Semaev is a professor with the Selmer Center at the Department of Informatics, UoB.
NB: Food and drinks will be served before the seminar outside the large auditorium.
Speaker: Igor Semaev (Selmersenteret, UiB)