scientific article

zbMath1066.11513MaRDI QIDQ3840196

Edlyn Teske

Publication date: 1998

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1423/14230541.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07)

Related Items

Improving ECDLP Computation in Characteristic 2 ⋮ On improvements of ther-adding walk in a finite field of characteristic 2 ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Improved Pollard rho method for computing discrete logarithms over finite extension fields ⋮ On random walks for Pollard's rho method ⋮ Computing elliptic curve discrete logarithms with the negation map ⋮ On computing the degree of a Chebyshev polynomial from its value ⋮ Sequences with good correlation property based on depth and interleaving techniques ⋮ Computational hardness of IFP and ECDLP ⋮ A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm ⋮ Security Analysis of the Strong Diffie-Hellman Problem ⋮ The parallelized Pollard kangaroo method in real quadratic function fields ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ Improving the parallelized Pollard lambda search on anomalous binary curves ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields