Algoritmos para Pruebas de Primalidad
Keywords:Criptografía, números primos, algoritmos de primalidad, teoría de números computacional.
En este artículo se discuten algoritmos determinísticos y probabilísticos para la determinación de la primalidad de un número lo que es de suma utilidad en procedimientos criptográcos.
ALFORD There are innitely many Carmichael numbers, Annals of Mathematics 140, 703-722, Princeton ,1994.
AGRAWAL M. Primes is in P, Annals of Mathematics 160, 781-793, Princeton , 2002.
DIFFIE W. New Directions in Cryptography, IEEE Trans. Inform Theory 22, 644-654, New York , 1976.
KOBLITZ N. A course in Number Theory and Cryptography, Springer-Verlag , Berlin , 1998.
LENSTRA, A. Computational Methods in public key Cryptography,
RIVEST, R. A Method for obtaining digital signatures and public key Cryptosystems, Communications of the ACM, Vol 21 pp. 120-126 , New York , 1978.
SHANNON, C Communication theory of secrecy systems, Bell Syst. Tech. J. 28, 656-715, New Jersey ,1949.
How to Cite
LicenseThe authors who publish in this journal accept the following conditions:
1. The authors retain the copyright and assign to the journal the right of the first publication, with the work registered with the Creative Commons Attribution License, which allows third parties to use what is published whenever they mention the authorship of the work And to the first publication in this magazine.
2. Authors may make other independent and additional contractual arrangements for non-exclusive distribution of the version of the article published in this journal (eg, include it in an institutional repository or publish it in a book) provided they clearly state that The paper was first published in this journal.
3. Authors are encouraged to publish their work on the Internet (for example, on institutional or personal pages) before and during the review and publication process, as it can lead to productive exchanges and to a greater and more rapid dissemination Of the published work.