doi:10.1090/S0025-5718-2014-02849-4engGrau, José MaríaOller Marcén, Antonio M.Sadornil, DanielA primality test for Kp^n+1 numbersART-2015-83335In this paper we generalize the classical Proth's theorem and the Miller-Rabin test for integers of the form N = Kpn +1. For these families, we present variations on the classical Pocklington's results and, in particular, a primality test whose computational complexity is Õ(log2 N) and, what is more important, that requires only one modular exponentiation modulo N similar to that of Fermat's test.2015http://zaguan.unizar.es/record/4657410.1090/S0025-5718-2014-02849-4http://zaguan.unizar.es/record/46574oai:zaguan.unizar.es:46574MATHEMATICS OF COMPUTATION 84 (2015), 505-512by-nchttp://creativecommons.org/licenses/by-nc/3.0/es/info:eu-repo/semantics/openAccess