The following pages link to (Q2765016):
Displaying 9 items.
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← 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)
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых (Q3381832) (← links)
- Construction of strong elliptic curves suitable for cryptographic applications (Q3383074) (← links)
- Non-Interactive Key Exchange (Q4916014) (← links)
