Pages that link to "Item:Q2948404"
From MaRDI portal
The following pages link to Generic Hardness of the Multiple Discrete Logarithm Problem (Q2948404):
Displaying 16 items.
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. (Q1603445) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- The Discrete Logarithm problem with preprocessing (Q1648845) (← links)
- Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
- DLP in semigroups: algorithms and lower bounds (Q2099245) (← links)
- The ``Quantum annoying'' property of password-authenticated key exchange protocols (Q2118533) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Multiple Discrete Logarithm Problems with Auxiliary Inputs (Q2811130) (← links)
- Algorithmic Number Theory (Q5899277) (← links)
- The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299) (← links)
- Bounds in Various Generalized Settings of the Discrete Logarithm Problem (Q6487216) (← links)
- Rogue-instance security for batch knowledge proofs (Q6581786) (← links)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- Quantum complexity for discrete logarithms and related problems (Q6652978) (← links)
- Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method (Q6663524) (← links)
