Efficiency Analysis of the RSA Algorithm in Low Computational Performance Mobile Environments

Implementation of the RSA algorithm in a mobile environment

Abstract

This article shows the results of a research project carried out at the Universidad Distrital Francisco Jose de Caldas with the implementation of the encryption algorithm proposed by Rivest, Shamir and Adleman (RSA) in mobile computing environments and low computational resources, for this purpose, tests were carried out with the algorithm for prime numbers with a smaller number of bits (between three and nine bits), which make up the prime numbers necessary for the generation of public and private keys, in order to validate the computational efficiency and whether it is sufficient to use this type of key to protect information in such computing environments.