Computational Reduction of Wilson's Primality Test for Modern Cryptosystems
Chia-Long Wu, Der‐Chyuan Lou, Te-Jen Chang · 2009
In this paper, a method of diminishing computational reduction to improve Wilson's primality test method is proposed. Basically, the RSA algorithm entails a modular exponentiation operation on large integers, which is considerably time-consuming to implement. Since ancient time, number theory has been an important study subject and modular arithmetic has also been widely used in cryptography. The Wilson’s primality test method is one of the most well-known deterministic prime number test methods. It states that n is a prime number if and only if ( 1)! 1mod n n . In this paper, we compare two primality