因式分解与离散对数的难度比较：一个240位数的实验
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
摘要：
我们报告了两个新记录：RSA-240的因子分解，一个795位的数字，和一个795位素数域上的离散对数计算。之前的记录是2009年RSA-768的因子分解和2016年的768位离散对数计算。我们在795位级别上的两次计算是使用相同的硬件和软件完成的，并且表明计算离散对数并不比相同大小的因子分解难多少。此外，由于算法变体和精心选择的参数，我们的计算比基于先前记录的预期要便宜得多。本文的最后一页还报告了RSA-250的因子分解。
英文摘要：
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not much harder than a factorization of the same size. Moreover, thanks to algorithmic variants and well-chosen parameters, our computations were significantly less expensive than anticipated based on previous records.The last page of this paper also reports on the factorization of RSA-250.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
