Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms

DOI10.1016/J.IPL.2021.106225OpenAlexW3214015652WikidataQ121131802 ScholiaQ121131802MaRDI QIDQ2059908

Haoxuan Wu, Qianheng Duan, Yuqing Zhu, Jincheng Zhuang

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106225

zbMATH Keywords

analysis of algorithmsdiscrete logarithm problempublic key cryptographyparameter selectionbirthday problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-uniform birthday problem with applications to discrete logarithms
• Exchangeable pairs and Poisson approximation
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Poisson approximation for dependent trials
• Kangaroos, monopoly and discrete logarithms
• The matching, birthday and the strong birthday problem: a contemporary review
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• On Diffie-Hellman Key Agreement with Short Exponents
• Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Computing discrete logarithms in an interval
• Algorithmic Number Theory

This page was built for publication: Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms