46574 20210121114510.0 doi 10.1090/S0025-5718-2014-02849-4 sideral 83335 ART-2015-83335 eng Grau, José María A primality test for Kp^n+1 numbers 2015 Access copy available to the general public Unrestricted In 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. info:eu-repo/semantics/openAccess by-nc http://creativecommons.org/licenses/by-nc/3.0/es/ 1.464 2015 MATHEMATICS, APPLIED 39 / 254 = 0.154 2015 Q1 T1 1.521 2015 Algebra and Number Theory 2015 Q1 Computational Mathematics 2015 Q1 Applied Mathematics 2015 Q1 info:eu-repo/semantics/article info:eu-repo/semantics/acceptedVersion (orcid)0000-0002-8191-3199 Oller Marcén, Antonio M. Sadornil, Daniel 84 (2015), 505-512 Math. comput. MATHEMATICS OF COMPUTATION 0025-5718 163768 http://zaguan.unizar.es/record/46574/files/texto_completo.pdf Postprint 61614 http://zaguan.unizar.es/record/46574/files/texto_completo.jpg?subformat=icon icon Postprint oai:zaguan.unizar.es:46574 articulos driver 2021-01-21-10:56:45 ARTICLE