论文标题
分类学和实践评估原始测试算法
Taxonomy and Practical Evaluation of Primality Testing Algorithms
论文作者
论文摘要
现代加密算法通常用于确保信息安全。在许多不对称加密算法中都需要质数。例如，RSA算法选择两个较大的素数并相互乘以乘以，以获得一个非常困难的分解的大复合数。产生质数并不是一件容易的事，因为它们不是通过整数定期分发的。原始测试算法用于确定特定数字是质数还是复合材料。在本文中，在几种原始测试算法中进行了深入的调查，显示了利弊，时间复杂性以及每种算法的简要摘要。此外，使用Java和Python作为编程语言来完成这些算法的实现，以评估算法和编程语言的效率。
Modern cryptography algorithms are commonly used to ensure information security. Prime numbers are needed in many asymmetric cryptography algorithms. For example, RSA algorithm selects two large prime numbers and multiplies to each other to obtain a large composite number whose factorization is very difficult. Producing a prime number is not an easy task as they are not distributed regularly through integers. Primality testing algorithms are used to determine whether a particular number is prime or composite. In this paper, an intensive survey is thoroughly conducted among the several primality testing algorithms showing the pros and cons, the time complexity, and a brief summary of each algorithm. Besides, an implementation of these algorithms is accomplished using Java and Python as programming languages to evaluate the efficiency of both the algorithms and the programming languages.
