How to Solve Multiple Short-Exponent Discrete Logarithm Problem

DOI10.1007/978-3-030-26834-3_4MaRDI QIDQ6488930

Unnamed Author, Kaoru Kurosawa, Unnamed Author, Akinaga Ueda

Publication date: 14 March 2024

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• The Discrete Logarithm problem with preprocessing
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
• Computing Small Discrete Logarithms Faster
• Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
• Simple Functional Encryption Schemes for Inner Products
• Generic Hardness of the Multiple Discrete Logarithm Problem
• Monte Carlo Methods for Index Computation (mod p)
• Theory of Cryptography

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