The following pages link to (Q3840196):
Displaying 20 items.
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- Sequences with good correlation property based on depth and interleaving techniques (Q499671) (← links)
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
- On computing the degree of a Chebyshev polynomial from its value (Q2229707) (← links)
- Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
- On random walks for Pollard's rho method (Q2701566) (← links)
- The parallelized Pollard kangaroo method in real quadratic function fields (Q2781226) (← links)
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields (Q2871193) (← links)
- Structure computation and discrete logarithms in finite abelian $p$-groups (Q3081295) (← links)
- Security Analysis of the Strong Diffie-Hellman Problem (Q3593084) (← links)
- Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) (← links)
- Improving the parallelized Pollard lambda search on anomalous binary curves (Q4501048) (← links)
- Improving ECDLP Computation in Characteristic 2 (Q5040425) (← links)
- On improvements of the<i>r</i>-adding walk in a finite field of characteristic 2 (Q5069758) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
