The Implementation of the RSA-CRT Algorithm for Securing Banking Customer Data

Abstract

Data security is a crucial aspect in the digital era, particularly in sectors that handle sensitive information such as banking. This study implements and evaluates the RSA and RSA-CRT algorithms to secure customer data, focusing on their performance in terms of decryption efficiency, memory usage, and resistance to brute-force attacks. Experimental results demonstrate that RSA-CRT is significantly more efficient than standard RSA in decryption processes. Across five test files ranging from 6.53 MB to 33.1 MB and using 2048-bit keys, RSA-CRT achieved an average time efficiency improvement of approximately 71%. In terms of memory usage, RSA-CRT consumed slightly less memory than RSA for smaller files but tended to use more memory for larger files—up to 370.84 MB compared to RSA's 340.86 MB for a 33.1 MB file. Despite the increased memory usage, this trade-off is considered acceptable given the substantial speed gains. Additionally, brute-force testing revealed that decryption time increases exponentially with key length, making attacks on 2048-bit RSA keys highly impractical. These findings affirm that RSA-CRT is a viable modern cryptographic solution for protecting sensitive data, offering both high performance and robust security, provided the system's memory capacity can support the process