A non-uniform birthday problem with applications to discrete logarithms

We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in groups. More precisely, we consider sampling coloured balls and placing them in urns, such that the distribution of assigning balls to urns depends...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 160; číslo 10-11; s. 1547 - 1560
Hlavní autoři: Galbraith, Steven D., Holmes, Mark
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.07.2012
Témata:
Algorithms
Birthday paradox
Color
Colour
Discrete logarithm problem
Logarithms
Mathematical analysis
Paradoxes
Placing
Probabilistic analysis of randomised algorithms
Sampling
Birthday paradox
Probabilistic analysis of randomised algorithms
Discrete logarithm problem
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in groups. More precisely, we consider sampling coloured balls and placing them in urns, such that the distribution of assigning balls to urns depends on the colour of the ball. We determine the expected number of trials until two balls of different colours are placed in the same urn. As an aside we present an amusing “paradox” about birthdays.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2012.02.019