1. Cherepnev, M.A.: On the relationship between the complexity of discrete logarithm and Diffie-Hellman problems. Discrete Math. 8(3), 22–30 (1996)
2. Shoup V.: Lower bounds for discrete logarithms and related problems. In: Advances in Cryptology - Eurocrypt’97, Lecture Notes in Computer Science, vol. 1233, pp. 256–266, Springer (1997)
3. Koblitz, N., Menezes, A., Shparlinski, I.E.: Discrete Logarithms. Diffie–Hellman, and Reductions, Vietnam. J Math. 39(3), 267–285 (2011)
4. Cherepnev, M.A.: Obtaining an upper bound on the whole factorization problem involving the complexity of the Diffie-Hellman problem. Discrete Math. Appl. 32(1), 110–114 (2020) (in Russian)
5. Pratt, V.: Every prime has a succinct certificate. SIAM J. Comput. 4(3), 214–220 (1975)