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

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 160; číslo 10-11; s. 1547 - 1560
Hlavní autori:	Galbraith, Steven D., Holmes, Mark
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2012
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!