对于大多数计算机来说找到一个非常大的数字的两个素因子是一件是难的事。
Finding two prime factors of a very large number is a difficult task for most computers.
首先，计算机要找到这个数字的因子，然后该计算机还要判定这个是因子是否是素因子。
First, the computer must determine the factors of the large number. Then, the computer must determine if the factors are prime Numbers.
与现在的素因子fft算法相比较，这种算法不仅节省了约一半内存，而且有更高的计算效率。
Comparing with existing prime factor FFT algorithms, this algorithm saves about half of the storage and possesses a higher efficiency.
应用推荐