Answers are grounded in this paper and cite their sources.
Analyzing the Self-Exponent Problem, which presents new challenges in proof-of-work systems, suggesting important implications for cryptography.
We introduce the Self-Exponent Problem (SEP): given a cyclic group G = ⟨g⟩ of order N and a target value b ∈ ℤ_N, find a ∈ ℤ_N such that a·g^a ≡ b (mod N). We prove that SEP requires Ω(N) group operations in the Generic Group Model, making it √N harder than the discrete logarithm problem. We systematically analyze resistance to known attacks including Baby-Step Giant-Step, Pohlig-Hellman, Index Calculus, and lattice methods. Applications to proof-of-work systems are discussed.
No takes yet. Share an insight, caveat, or question.
Aliaksei Naboko (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: