Regresar

Rsa over-encryption implementation for networking: A proof of concept using mobile devices

Abstract:

RSA is a cryptographic system which is widely used to protect the confidentiality of information transmitted over the Internet or other insecure networks. However, RSA is a probabilistic encryption algorithm, which has random components. This increases the probability that an attacker will find a technique for calculating the generated keys. To solve this problem, this study aims to increase the security of the RSA encrypted message by investing a minimal amount of extra time over-encryption and over-decryption. To achieve this, some variants have been introduced to the baseline method. Once the RSA encrypted message is obtained, a conversion of the decimal number system to a base b is performed. This results in a value of lesser length. The value n is generated randomly. To produce a mixture of the characters of the RSA message changed to base b, a matrix is used and the indexes of the rows of that matrix are randomly generated. In this case, each cod element is an ASCII character whose value is the position it occupies within its respective row. In practice the matrix has m rows per b columns where m ∈ Z/1 < m < b!. All rows represent strings randomly mixed. The results of the tests performed demonstrates an increase of 3.4 per thousand of time with respect to the decrypted-encryption RSA. Nevertheless, the algorithm greatly increases network security.