Abstract
In this paper, a new technique is deployed to afford a strong secure algorithm based on dynamic keys strategy. The objective of this technique is to provide confidentiality and authentication of data between any partners. The proposed technique takes Multiple keys pair(Public and Private) with RSA algorithm that used fast expansion to enhancement the speed of RSA. Simulation results have been achieved using MATLAB R2014a; Single Key RSA (SK-RSA) and proposed Multi Keys RSA (MK-RSA) are compared analysis is made on execution time. Hence, deploying the MK-RSA algorithm is proving more secure than SK-RSA algorithm.
Highlights
With the evolution of communication systems and information technology, data that is transmitted over networks have become more valuable
Proposed multi keys RSA (MK- RSA) algorithm implemented for confidentiality and digital signature 1) Run the RSA- MK.m Matlab code in Matlab software
Where Multi Keys RSA (MK- RSA) algorithm deployed one session keys pair from the list of keys for each implementation to achieve the strategy of dynamic keys to ensure the security of communication systems
Summary
With the evolution of communication systems and information technology, data that is transmitted over networks have become more valuable. This leads to catch up the attention of attackers and researchers to focus in this area. The asymmetric cryptographic add many application as Encryption/ Decryption, Digital Signature and Key exchange. The most widely used algorithm in the asymmetric cryptographic is RSA (Rivest- Shamir- Adleman) which, proposed by Ron Rivest, Adi Shamir and Leonard Adleman [3]. In [5] the authors proposed a variant of RSA to simplify the operation of decryption and digital signature at the receiver side
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Iraqi Journal of Information & Communications Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.