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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 160; H. 10-11; S. 1547 - 1560
Hauptverfasser:	Galbraith, Steven D., Holmes, Mark
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2012
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!