Generic Hardness of the Multiple Discrete Logarithm Problem

DOI10.1007/978-3-662-46803-6_27MaRDI QIDQ2948404zbMATH OpenOpenAlexFDO

Authors Aaram Yun

Publication date 30 September 2015

Published in Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46803-6_27

zbMATH Keywords

generic group modelmultiple discrete logarithmsearch-by-hyperplane-queries

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On generic complexity of the discrete logarithm problem
• Algorithmic Number Theory
• On the Complexity of Hyperelliptic Discrete Logarithm Problem
• Bounds in various generalized settings of the discrete logarithm problem
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Complexity of a determinate algorithm for the discrete logarithm
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• On Search Complexity of Discrete Logarithm
• The discrete logarithm problem from a local duality perspective
• Linear complexity of the discrete logarithm

Cited in

(21)

• Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
• Bootstrapping for approximate homomorphic encryption
• The Discrete Logarithm problem with preprocessing
• Everybody's a target: scalability in public-key encryption
• DLP in semigroups: algorithms and lower bounds
• The ``Quantum annoying property of password-authenticated key exchange protocols
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• Multiple Discrete Logarithm Problems with Auxiliary Inputs
• On generic complexity of the discrete logarithm problem
• Algorithmic Number Theory
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• Bounds in various generalized settings of the discrete logarithm problem
• How to Solve Multiple Short-Exponent Discrete Logarithm Problem
• Rogue-instance security for batch knowledge proofs
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
• Quantum complexity for discrete logarithms and related problems
• Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
• A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
• Multiple group action dlogs with(out) precomputation
• The structured generic-group model
• Recent progress on the elliptic curve discrete logarithm problem

This page was built for publication: Generic Hardness of the Multiple Discrete Logarithm Problem

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