How to Solve Multiple Short-Exponent Discrete Logarithm Problem

DOI10.1007/978-3-030-26834-3_4MaRDI QIDQ6488930zbMATH OpenFDO

Authors Kaoru Kurosawa, Akinaga Ueda

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-26834-3_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• Computing small discrete logarithms faster
• Computing discrete logarithms in an interval
• The Discrete Logarithm problem with preprocessing
• Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval

Cites work

• Computing small discrete logarithms faster
• Fully secure functional encryption for inner products, from standard assumptions
• Generic Hardness of the Multiple Discrete Logarithm Problem
• scientific article; zbMATH DE number 2085207 (Why is no real title available?)
• Monte Carlo Methods for Index Computation (mod p)
• Multi-user collisions: applications to discrete logarithm, Even-Mansour and PRINCE
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• Simple functional encryption schemes for inner products
• The Discrete Logarithm problem with preprocessing
• Theory of Cryptography

This page was built for publication: How to Solve Multiple Short-Exponent Discrete Logarithm Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488930)