fresh_42 said:my personal bet is a flaw
This doesn't rule out the other possibility. However, I have to admit that I'm biased, which is why I said personal opinion.PeterDonis said:I'm not sure there is necessarily a flaw in the actual math, just in the claim that this result "destroys the RSA cryptosystem".
bahamagreen said:The linked abstract alone is "Date: received 1 Mar 2021, last revised 3 Mar 2021"
The PDF linked paper with the different abstract is "work in progress 31.10.2019"
I think we will have to take his age into account. This could explain the differences on the time table as well as the missing capability to test the algorithm. Of course this is speculative, and I'm not saying we have a similar case as Atiyah and RH here. But the parallels come to mind.PeterDonis said:An interesting post about how the claimed capabilities of the algorithm described in the paper could be tested:
fresh_42 said:the missing capability to test the algorithm
Leo Ducas, one of the top experts in lattice-based cryptography (and especially in its cryptanalysis) has implemented the March 3 version of the paper (in Sage). The preliminary experimental evaluations seem to indicate that the method cannot outperform the state of the art (quoted from Sage code to test algorithm):
This suggest that the approach may be sensible, but that not all short vectors give rise to factoring relations, and that obtaining a sufficient success rate requires much larger lattice dimension than claimed
Cryptology is the study of codes, ciphers, and other methods of securing information. It involves using mathematical algorithms to encrypt data, making it unreadable to anyone without the proper key. This ensures the confidentiality and integrity of sensitive information.
RSA is a widely used public-key cryptosystem that is based on the difficulty of factoring large integers. It is named after its inventors, Ron Rivest, Adi Shamir, and Leonard Adleman, and is commonly used for secure communication, digital signatures, and authentication.
Fast factoring of integers refers to the ability to quickly find the prime factors of large numbers. This is significant for RSA because the security of the algorithm relies on the difficulty of factoring large numbers. If fast factoring algorithms are developed, it could potentially make RSA vulnerable to attacks.
SVP (shortest vector problem) algorithms are used in cryptology to solve lattice problems, which are mathematical problems that are difficult to solve using classical computers. These algorithms are important in cryptanalysis, which is the process of breaking codes and ciphers to reveal the hidden information.
At this time, there is no evidence to suggest that SVP algorithms can completely destroy RSA. While these algorithms have the potential to make factoring integers easier, there are still many challenges and limitations to overcome. Additionally, there are other factors, such as key length and implementation, that can affect the security of RSA.