Pages that link to "Item:Q2765016"
From MaRDI portal
The following pages link to Square-root algorithms for the discrete logarithm problem (a survey) (Q2765016):
Displaying 17 items.
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Computing discrete logarithms with the parallelized kangaroo method. (Q1408372) (← links)
- Kangaroos, monopoly and discrete logarithms (Q1590361) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- Complexity of a determinate algorithm for the discrete logarithm (Q1898267) (← links)
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
- Baby-step giant-step algorithms for the symmetric group (Q2409009) (← links)
- A nonlinear elliptic curve cryptosystem based on matrices (Q2490197) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- Baby-step giant-step algorithms for non-uniform distributions (Q2739441) (← links)
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых (Q3381832) (← links)
- Construction of strong elliptic curves suitable for cryptographic applications (Q3383074) (← links)
- What is the inverse of repeated square and multiply algorithm? (Q3623254) (← links)
- Non-Interactive Key Exchange (Q4916014) (← links)
- Computation and Formal Verification of SRT Quotient and Square Root Digit Selection Tables (Q5274390) (← links)
