科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we generalize the classical Proth's theorem and the Miller-Rabin test for integers of the form N = Kp(n) + 1. For these families, we present variations on the classical Pocklington's results and, in particular, a primality test whose computational complexity is (O) over tilde (log(2) N) and, what is more important, that requires only one modular exponentiation modulo N similar to that of Fermat's test.
- 出版日期2015-1
