Prime Number Determinacy Algorithm Analysis
Huan Xie · Computer Technology and Development · 2011
With rapid development of computer technology and cryptology,improving the efficiency of generating of large prime number and constructing the prime number library have become the trend of computer industry.To explore the efficiency and stability of the algorithm,propose the algorithm execution time method and slope analysis of time curve method.With the improved prime number determinacy algorithm,calculate the time it needs to obtain all the prime numbers within nn≥106 and do it ten times,in order to get the algorithm execution time and time curve to prove the efficiency and stability of the algorithm.The results prove that efficiency is higher while the algorithm execution time shorter,at the same time stability is higher while time curve slope smaller.The execution efficiency and stability of the algorithm is much better than trial division,and 6k±1 method is superior to parity filtering.