Abstract

Information and communication technology are spreading very rapidly in terms of information exchange over the Internet, and this information is vulnerable to threats by hackers. Information security is mainly achieved by using encryption techniques to protect it when it is transmitted over an unsecured channel. In this paper, a modified encryption system for the RSA algorithm is presented using a fixed encryption key size and divide that key into specific sections, to encrypt and decrypt blocks using multiple public and private keys. The encryption process can be done for each block by choosing different keys according to the random generator key (seed key) and encrypt each block with these different keys. Through the random arrangement of blocks and the properties of a modified cipher block in the RSA algorithm within the proposed model, to increase security at the expense of time, the use of large keys in the RSA algorithm is very slow since small RSA keys are vulnerable to factorization attacks. To overcome that problem, we increase complexity and use larger block sizes without sacrificing speed, and compare them with the original RSA algorithm. As a result, this method is more efficient, secured, and not easily breakable.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call