1. Bos J.W., Kleinjung T., Lenstra A.K.: On the use of the negation map in the Pollard rho method. In: Algorithmic Number Theory Symposium-ANTS 2010, pp. 66–82. Springer, Berlin (2010).
2. Galbraith S.D., Holmes M.: A non-uniform birthday problem with applications to discrete logarithms. Discret. Appl. Math. 160(10), 1547–1560 (2012).
3. Galbraith S.D., Ruprai R.S.: An improvement to the Gaudry–Schost algorithm for multidimensional discrete logarithm problems. In: Proceedings of the 12th IMA International Conference on Cryptography and Coding, pp. 368–382. Springer, Berlin (2009).
4. Galbraith S.D., Ruprai R.S.: Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval. In: Public Key Cryptography-PKC 2010, pp. 368–383. Springer, Berlin (2010).
5. Galbraith S.D., Lin X., Scott M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Advances in Cryptology-EUROCRYPT 2009, pp. 518–535. Springer, Berlin (2009).