naxprime.blogg.se

Stallings, cryptography and network security principles and practice, 7th edition.

The test was processed for 15 hours until the test computer resource runs out. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. It also applies to the encryption and decryption process. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number.

Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. This method was applied to instant messaging using TCP sockets. ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation.

This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS).