Resumo

JANAMPA PATILLA, Hubner. Modular arithmetic as a security and vulnerability mechanism in the RSA cryptographic system. Rev cuba cienc informat [online]. 2020, vol.14, n.2, pp.98-130.  Epub 01-Jun-2020. ISSN 2227-1899.

Modular arithmetic is the mathematical basis for the security mechanism of the cryptographic system of RSA asymmetric public key. We will show the mathematical foundations of modular arithmetic for the encryption and decryption of a plain text, we define the basis on the use of arithmetic addition operations, multiplication and exponentiation on module-n arithmetic. We will mention the criteria for generating two prime numbers p and q to calculate the public and private key using the RSA algorithm. We will show the importance of the number of significant figures of these prime numbers as a security mechanism to avoid factoring them, in addition to vulnerabilities and attacks at the protocol level; to mathematical and lateral channel level, which the RSA system has due to the use of modulo-n arithmetic. I know develops and implements based on the imperative programming language Python, the mathematical execution of the RSA algorithm for key generation, encryption and decryption.

Palavras-chave : modular arithmetic; encryption; decryption; RSA; prime number.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )