Comparative Efficiency of Algorithms for Solving the Elliptic Curve Discrete Log Problem: A Case Study of Brute Force, Pollard’s Rho, and Shank’s Baby-Step Giant-Step
Nicholas Axel Tanujaya, Jose Gabriel Thendito, Faisal, Yuhani Yusof
Elsevier ·
2025-01-01
· DOI 10.1016/j.procs.2025.09.076
The publisher did not provide an abstract — full text is available via the link below.
Nicholas Axel Tanujaya, Jose Gabriel Thendito, Faisal, Yuhani Yusof. Comparative Efficiency of Algorithms for Solving the Elliptic Curve Discrete Log Problem: A Case Study of Brute Force, Pollard’s Rho, and Shank’s Baby-Step Giant-Step. // Procedia Computer Science. – 2025. – DOI: 10.1016/j.procs.2025.09.076. – URL: https://doi.org/10.1016/j.procs.2025.09.076
Nicholas Axel Tanujaya, Jose Gabriel Thendito, Faisal, & Yuhani Yusof (2025). Comparative Efficiency of Algorithms for Solving the Elliptic Curve Discrete Log Problem: A Case Study of Brute Force, Pollard’s Rho, and Shank’s Baby-Step Giant-Step. Procedia Computer Science. https://doi.org/10.1016/j.procs.2025.09.076
Nicholas Axel Tanujaya, et al. “Comparative Efficiency of Algorithms for Solving the Elliptic Curve Discrete Log Problem: A Case Study of Brute Force, Pollard’s Rho, and Shank’s Baby-Step Giant-Step.” Procedia Computer Science, 2025. doi:10.1016/j.procs.2025.09.076.
@article{Tanujaya2025,
title = {Comparative Efficiency of Algorithms for Solving the Elliptic Curve Discrete Log Problem: A Case Study of Brute Force, Pollard’s Rho, and Shank’s Baby-Step Giant-Step},
author = {Tanujaya, Nicholas Axel and Thendito, Jose Gabriel and Faisal and Yusof, Yuhani},
journal = {Procedia Computer Science},
year = {2025},
doi = {10.1016/j.procs.2025.09.076},
url = {https://doi.org/10.1016/j.procs.2025.09.076}
}