Square-root algorithms for the discrete logarithm problem (a survey)
From MaRDI portal
Recommendations
Cited in
(20)- Computing discrete logarithms with the parallelized kangaroo method.
- Kangaroos, monopoly and discrete logarithms
- Computing low-weight discrete logarithms
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Complexity of a determinate algorithm for the discrete logarithm
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
- Baby-step giant-step algorithms for the symmetric group
- A nonlinear elliptic curve cryptosystem based on matrices
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- scientific article; zbMATH DE number 1643924 (Why is no real title available?)
- Computing small discrete logarithms faster
- Baby-step giant-step algorithms for the symmetric group
- Solving discrete logarithm problem in an interval using periodic iterates
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
- Construction of strong elliptic curves suitable for cryptographic applications
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
- What is the inverse of repeated square and multiply algorithm?
- Non-interactive key exchange
- Computation and Formal Verification of SRT Quotient and Square Root Digit Selection Tables
- On the complexity of computing the logarithm and square root functions on a complex domain
This page was built for publication: Square-root algorithms for the discrete logarithm problem (a survey)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765016)
