PRIMALITY TESTING OF LARGE NUMBERS IN MAPLE

Primality testing of large numbers is very important in many areas of mathematics, computer science and cryptography, and in recent years, many of the modern primality testing algorithms have been incorporated in Computer Algebra Systems (CAS) such as Axiom and Maple as a standard. In this paper, we discuss primality testing of large numbers in Maple V Release 3, a Maple version newly released in 1994. Our computation experience shows that the Maple primality testing facility isprime, based on a combined use of a strong pseudoprimality test and a Lucas test, is efficient and reliable.