Author:
Jindal Aayush,Kumar Sanjay,Jatain Aman
Publisher
Springer Nature Singapore
Reference31 articles.
1. Bailey DV et al (2009) The certicom challenges ECC2-X. Cryptology ePrint Archive Paper 2009/466. https://eprint.iacr.org/2009/466
2. Bernstein DJ et al (2016) Faster elliptic-curve discrete logarithms on FP-GAs. Cryptology ePrint Archive
3. Bos JW, Kleinjung T, Lenstra AK (2010) On the use of the negation map in the Pollard rho method. In: Algorithmic number theory: 9th international symposium, ANTS-IX, Nancy, France, 19–23 July 2010. Proceedings vol 9. Springer, pp 66–82
4. Brent RP (1980) An improved Monte Carlo factorization algorithm In: Bit 20, pp 176–184
5. Chavan K, Gupta I, Kulkarni D (2016) A review on solving ECDLP over large finite field using parallel Pollard’s rho ($$\rho $$) method. IOSR J Comput Eng 18(2):1–11