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

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 160; no. 10-11; pp. 1547 - 1560
Main Authors:	Galbraith, Steven D., Holmes, Mark
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2012
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!