Secret Keys Extraction Using Light Weight Schemes for Data Ciphering

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...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1999; no. 1; pp. 12114 - 12126
Main Authors Hussein, Sahar Najah, Al-Alak, Saif Mahmood
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.09.2021
Subjects
Encryption
Hash based algorithms
Hash function
Lightweight
Physics
Random variables
Randomness
RC5
SHA2
Signatures
TEA
Weight reduction
XTEA
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1999/1/012114