rsa加密 过程 离散数学_rsa和离散日志进一步崩溃

rsa加密 过程 离散数学

A while back a number of RSA challenges were created, such as for RSA-240 (and which has 240 decimal digits — 795 bits) [here]:

不久之前，创建了许多RSA挑战，例如RSA-240(具有240个十进制数字-795位)[ 在这里 ]：

But this week it was broken with:

但是这周它被打破了：

RSA-240 = 12462036678171878406583504460810659043482037465167880575481878888328 966680118821085503603957027250874750986476843845862105486553797025393057189121 768431828636284694840530161441643046806687569941524699318570418303051254959437 1372159029236099 = 509435952285839914555051023580843714132648382024111473186660296521821206469746 700620316443478873837606252372049619334517 times 244624208838318150567813139024002896653802092578931401452041221336558477095178 155258218897735030590669041302045908071447

This means that anything encrypted with anything less than 1,024 bits in RSA is in danger of being cracked. The new crack advances the state-of-the-art from 768 bits (cracked in December 2009) to 795 bits. The great advancement with his crack is that the researchers also broken a 795-bit discrete log problem, too. This is the first time that both the integer factorization of RSA and the discrete log problem (DLP) has been cracked together, and using the same hardware and software (CADO-NFS software with the Number Field Sieve algorithm). This cracking equates to 4,000 core-years and used Intel Xeon Gold 6130 CPUs:

这意味着用RSA中少于1,024位加密的任何数据都有被破解的危险。 新的破解将最先进的技术从768位(2009年12月破解)提高到795位。 他的破解取得的巨大进步是，研究人员还解决了795位离散对数问题。 这是首次使用相同的硬件和软件(具有Number Field Sieve算法的 CADO-NFS软件 )将RSA的整数分解和离散对数问题(DLP)一起破解。 这种破解相当于4000核年，并使用了英特尔至强金牌6130 CPU：

The results are:

结果是：

• RSA-240 sieving: 800 physical core-years.
  RSA-240筛选：800个物理核心年。
• RSA-240 matrix: 100 physical core-years.
  RSA-240矩阵：100个物理核心年。
• DLP-240 sieving: 2400 physical core-years
  DLP-240筛分：2400物理核年
• DLP-240 matrix: 700 physical core-years
  DLP-240矩阵：700个物理核心年

破解RSA？ (Cracking RSA?)

So if you have factored the modulus, how do you crack the cipher? With this we are using the RSA encryption method, and we have the encryption key (e,N). We must find the two prime numbers which create the value of N (p and q), and must use a factorization program to find them. Once we find the factors it is