@article{https://doi.org/10.48550/arxiv.2006.06197,
doi = {10.48550/ARXIV.2006.06197},
url = {https://arxiv.org/abs/2006.06197},
author = {Boudot,
Fabrice and Gaudry,
Pierrick and Guillevic,
Aurore and Heninger,
Nadia and Thomé,
Emmanuel and Zimmermann,
Paul},
keywords = {Cryptography and Security (cs.CR),
FOS: Computer and information sciences,
FOS: Computer and information sciences},
title = {Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment},
publisher = {arXiv},
year = {2020},
copyright = {arXiv.org perpetual,
non-exclusive license} }