Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
DOI10.1016/J.IPL.2021.106225OpenAlexW3214015652WikidataQ121131802 ScholiaQ121131802MaRDI QIDQ2059908FDOQ2059908
Authors: Haoxuan Wu, Jincheng Zhuang, Qianheng Duan, Yuqing Zhu 
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
Recommendations
analysis of algorithmsdiscrete logarithm problemparameter selectionpublic key cryptographybirthday problem
Cites Work
- Two moments suffice for Poisson approximations: The Chen-Stein method
- New directions in cryptography
- Title not available (Why is that?)
- Elliptic Curve Cryptosystems
- Title not available (Why is that?)
- Poisson approximation for dependent trials
- Kangaroos, monopoly and discrete logarithms
- On Diffie-Hellman Key Agreement with Short Exponents
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exchangeable pairs and Poisson approximation
- Title not available (Why is that?)
- Algorithmic Number Theory
- The matching, birthday and the strong birthday problem: a contemporary review
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
- A non-uniform birthday problem with applications to discrete logarithms
- Computing discrete logarithms in an interval
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
Cited In (1)
This page was built for publication: Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059908)
