随手记录一下我在两个星期前接到的一个项目，一个跟RSA因数分解有关的项目

这个项目涉及一个专利，在这里就不展示它的具体内容了

这个项目的大致内容是，使用专利中提到的搜索办法，对给定一个RSA的公钥，找到它的一个因数

专利的发明人是来自3所学校的老师，其中主要的负责人是来自于汕头大学的一位教授。专利中提到的搜索办法是基于一个叫做“RSA因数密化的集合体搜索”的算法，其数学基础来源于这位王教授在rsa因子搜索中的研究，同时他发明了很多数学工具来达到他的目的。

我对这个项目感兴趣的点在于，它涉及到了数学和计算机科学的交叉领域，当然还有密码学的部分。最大的兴趣在于，它是一个非常有挑战性的项目，需要我熟练掌握python编程，同时学会不断地优化代码，以达到更好的效果。

目前程序的编写以及优化已经达到第三代版本，在等待王教授他们优化算法，以便对原来的程序进行改进。

I’d like to record a project I received two weeks ago, which is related to RSA factorization.

The project involves a patent, whose specific content won’t be shown here.

The main task of the project is to use the search method mentioned in the patent to find a factor of a given RSA public key.

The patent is invented by teachers from three schools, with the main person in charge being a professor from Shantou University. The search method mentioned in the patent is based on an algorithm called “RSA factor - dense set search”, whose mathematical foundation comes from Professor Wang’s research on RSA factor search. He also invented many mathematical tools to achieve his goal.

What interests me about this project is that it involves the intersection of mathematics and computer science, as well as cryptography. The biggest interest lies in its challenging nature, which requires me to be proficient in Python programming and constantly optimize the code for better results.

Currently, the program writing and optimization have reached the third - generation version, and we are waiting for Professor Wang and his team to optimize the algorithm to improve the original program.