Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem
In the (preprocessing) Decisional Diffie-Hellman (DDH) problem, we are given a cyclic
group G with a generator g and a prime order N, and want to prepare some advice of S, such …
group G with a generator g and a prime order N, and want to prepare some advice of S, such …
A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More
M Hhan - arXiv preprint arXiv:2402.11269, 2024 - arxiv.org
This paper studies the limitations of the generic approaches to solving cryptographic
problems in classical and quantum settings in various models.-In the classical generic group …
problems in classical and quantum settings in various models.-In the classical generic group …
[HTML][HTML] Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
H Wu, J Zhuang - Information Processing Letters, 2025 - Elsevier
Discrete logarithm problem (DLP) is one of the fundamental hard problems used in
cryptography. For 1≤ k≤ n, solving the k-out-of-n DLP instances is an important problem …
cryptography. For 1≤ k≤ n, solving the k-out-of-n DLP instances is an important problem …
On the efficiency and security of secure group messaging
G Pascual Perez - 2024 - research-explorer.ista.ac.at
Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous
in today's society. Many of them provide not only end-to-end encryption, but also security …
in today's society. Many of them provide not only end-to-end encryption, but also security …