A non-uniform birthday problem with applications to discrete logarithms
暂无分享,去创建一个
[1] Louis H. Y. Chen. Poisson Approximation for Dependent Trials , 1975 .
[2] J. Pollard,et al. Monte Carlo methods for index computation () , 1978 .
[3] Steven D. Galbraith,et al. An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems , 2009, IMACC.
[4] G. Grimmett,et al. Probability and random processes , 2002 .
[5] L. Gordon,et al. Two moments su ce for Poisson approx-imations: the Chen-Stein method , 1989 .
[6] Anirban DasGupta,et al. The matching, birthday and the strong birthday problem: a contemporary review , 2005 .
[7] Éric Schost,et al. A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm , 2004, ANTS.
[8] P. Diaconis,et al. Exchangeable pairs and Poisson approximation , 2004, math/0411525.
[9] K. Nishimura,et al. Probability to meet in the middle , 2005, Journal of Cryptology.
[10] Jim Pitman,et al. Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities , 2000 .
[11] Masaaki Sibuya,et al. Occupancy with two types of balls , 1988 .
[12] Steven D. Galbraith,et al. Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval , 2010, IACR Cryptol. ePrint Arch..
[13] L. Gordon,et al. Poisson Approximation and the Chen-Stein Method , 1990 .
[14] Philippe Flajolet,et al. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..
[15] R. A. Doney,et al. 4. Probability and Random Processes , 1993 .
[16] B. I. Selivanov. On waiting time in the scheme of random allocation of coloured particies , 1995 .