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

DOI10.1016/J.IPL.2021.106225MaRDI QIDQ2059908OpenAlexWikidataFDO

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

zbMATH Keywords

analysis of algorithmsdiscrete logarithm problemparameter selectionpublic key cryptographybirthday problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A non-uniform birthday problem with applications to discrete logarithms
• On the birthday problem: Some generalizations and applications
• A Note on the Inverse Birthday Problem With Applications
• The analysis of singletons in generalized birthday problems
• The Birthday Problem Revisited

Cites work

• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1302855 (Why is no real title available?)
• scientific article; zbMATH DE number 1759796 (Why is no real title available?)
• scientific article; zbMATH DE number 2086905 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• A non-uniform birthday problem with applications to discrete logarithms
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Algorithmic Number Theory
• Computing discrete logarithms in an interval
• Elliptic Curve Cryptosystems
• Exchangeable pairs and Poisson approximation
• Kangaroos, monopoly and discrete logarithms
• New directions in cryptography
• On Diffie-Hellman Key Agreement with Short Exponents
• Poisson approximation for dependent trials
• The matching, birthday and the strong birthday problem: a contemporary review
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval

Cited in

(1)

• Refinements of the k-tree Algorithm for the Generalized Birthday Problem

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)