The transfer of confidential information over unsecure networks is associated with high risk as a result of potential data interception by third parties. Multiple encryption algorithms have been developed in order to protect data, requiring each party to encrypt and decrypt communications. Common encryption methods such as the RSA algorithm utilize asymmetric key pairs and perform with a high degree of success. However, these algorithms are prone to lengthy encryption times. This study performs a comparative analysis to classify the performance of multiple encryption algorithms to include RSA, SRNN, and 2 key pair models. The SRNN algorithm led to reduced encryption time, supporting the conclusion that this encryption scheme may provide a more efficient alternative to the current algorithms in use.