Reduction of complexity in asymmetric cryptography using RSA, RSA-CRT and novel N-prime RSA with different keys.

The primary goal of this study is to provide hashed private keys of big size and authentication mechanisms in order to increase security and decrease the time complexity of transferring private data over a computer network. Thus, the solutions to the encryption and decryption processes increase both security and privacy. The use of a combination of keys is crucial, since it allows for simplification. Group 1 consists of RSA, Group 2 is RSA-CRT, and Group 3 is Novel N-PRIME RSA, all of which are employed in this research. N=10 was chosen as the sample size to apply this study's findings for each group. Pre-test confidence levels were maintained at 80%. Comparing the performance of Novel N-PRIME RSA with that of RSA and RSA-CRT, we find that it excels in both the encryption and decryption phases of the process, with a time complexity rate that seems low for the former. The 95 percent confidence interval for the means of accuracy for RSA, RSA-CRT, and N-PRIME RSA is p(0.003), 84.8900 sec, and 80.245 sec, respectively. It can be shown from the complexity figures that Novel N-PRIME RSA performs better than both RSA and RSA-CRT. [ABSTRACT FROM AUTHOR]

Copyright of AIP Conference Proceedings is the property of American Institute of Physics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)