Pages that link to "Item:Q4912022"
From MaRDI portal
The following pages link to Computing discrete logarithms in an interval (Q4912022):
Displaying 10 items.
- A non-uniform birthday problem with applications to discrete logarithms (Q427899) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms (Q2059908) (← links)
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm (Q2408279) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates (Q3297479) (← links)
- Computing Interval Discrete Logarithm Problem with Restricted Jump Method (Q4988923) (← links)
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing (Q5918863) (← links)
