Ahmed Mezher - Academia.edu (original) (raw)
Papers by Ahmed Mezher
International Journal of Electrical and Computer Engineering (IJECE), 2018
Security is one of the most important concern to the information and data sharing for companies, ... more Security is one of the most important concern to the information and data sharing for companies, banks, organizations and government facilities. RSA is a public cryptographic algorithm that is designed specifically for authentication and data encryption. One of the most powerful reasons makes RSA more secure is that the avoidance of key exchange in the encryption and decryption processes. Standard RSA algorithm depends on the key length only to protect systems. However, RSA key is broken from time to another due to the development of computers hardware such as high speed processors and advanced technology. RSA developers have increased a key length or size of a key periodically to maintain a high security and privacy to systems that are protected by the RSA. In this paper, a method has been designed and implemented to strengthen the RSA algorithm by using multiple public and private keys. Therefore, in this method the security of RSA not only depends on the key size, but also relies on the multiplicity of public and private keys. 1. INTRODUCTION Encryption is the way of transforming a message to another form that is completely different from its original one and it is difficult to read by an intruder. This enables people to secure sensitive information to be sent over the network. There are two main kinds of cryptography which are symmetric and asymmetric. In symmetric cryptography, the key used for encryption is the same key used for decryption process [1], [2]. There are many well-known algorithms of this kind of cryptography such as DES, AES, etc. While the other kind of cryptography is asymmetric. In asymmetric cryptography, there are two keys which are public key and private key, one for encryption and the other used for decryption [3]. The last type of cryptography is considered the most revolutionary change in the cryptography science [4], [5]. RSA is considered one of the most effective algorithm that can be used for both encryption and digital signature [6]-[8]. The strength of the algorithm depends on the factorization problem. The factorization is considered as challenging problem to mathematicians for many decades because it is NP complete problem [9]. Therefore, RSA strength comes from the previous point. In addition, the algorithm is well-known cryptographic algorithm that is invented by Shamir and Adelman in 1977 [10]. In the RSA algorithm, encryption and decryption can be performed by using two keys, one of them is public while the other one is private. To encrypt a message, the public key is used, then the cipher text and the public key are sent to a receiver. The receiver use their own private key to decrypt the cipher text. The private key will not send over a network during the sending process, and this is how public cryptography works.
International Journal of Electrical and Computer Engineering (IJECE), 2018
Security is one of the most important concern to the information and data sharing for companies, ... more Security is one of the most important concern to the information and data sharing for companies, banks, organizations and government facilities. RSA is a public cryptographic algorithm that is designed specifically for authentication and data encryption. One of the most powerful reasons makes RSA more secure is that the avoidance of key exchange in the encryption and decryption processes. Standard RSA algorithm depends on the key length only to protect systems. However, RSA key is broken from time to another due to the development of computers hardware such as high speed processors and advanced technology. RSA developers have increased a key length or size of a key periodically to maintain a high security and privacy to systems that are protected by the RSA. In this paper, a method has been designed and implemented to strengthen the RSA algorithm by using multiple public and private keys. Therefore, in this method the security of RSA not only depends on the key size, but also relies on the multiplicity of public and private keys. 1. INTRODUCTION Encryption is the way of transforming a message to another form that is completely different from its original one and it is difficult to read by an intruder. This enables people to secure sensitive information to be sent over the network. There are two main kinds of cryptography which are symmetric and asymmetric. In symmetric cryptography, the key used for encryption is the same key used for decryption process [1], [2]. There are many well-known algorithms of this kind of cryptography such as DES, AES, etc. While the other kind of cryptography is asymmetric. In asymmetric cryptography, there are two keys which are public key and private key, one for encryption and the other used for decryption [3]. The last type of cryptography is considered the most revolutionary change in the cryptography science [4], [5]. RSA is considered one of the most effective algorithm that can be used for both encryption and digital signature [6]-[8]. The strength of the algorithm depends on the factorization problem. The factorization is considered as challenging problem to mathematicians for many decades because it is NP complete problem [9]. Therefore, RSA strength comes from the previous point. In addition, the algorithm is well-known cryptographic algorithm that is invented by Shamir and Adelman in 1977 [10]. In the RSA algorithm, encryption and decryption can be performed by using two keys, one of them is public while the other one is private. To encrypt a message, the public key is used, then the cipher text and the public key are sent to a receiver. The receiver use their own private key to decrypt the cipher text. The private key will not send over a network during the sending process, and this is how public cryptography works.