Abstract
One of the most essential methods used to provide security services is encryption. One key is used for encoding in symmetric encryption. The symmetric encryption depends on the encryption block, switching, and replacing. Therefore, it is a problem if the received secret keys from protocols are frequents in some states or they have less randomness. In this paper, a Light Weight Multiple Key Generating (LWM) is proposed to generate the secret keys which are using Light Weight Schemes (LWS). In this work, six experiments are implemented. Three LWA are utilized, which are Xtea, RC5, and Tea algorithms. The SHA2 hash function is used to merge the chains. The diehard test is used in all experiments to determine the randomness of the secret key produced. The entropy is a measure of the uncertainty of a random variable.
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 callDisclaimer: 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.
