Abstract
LBlock-s key schedule algorithm is a modified version of LBlock key schedule algorithm that has been claimed to have better diffusion properties. Using correlation test based on Niaz method we conclude that LBlock-s’ key schedule algorithm produced high correlation keys. In other words, their randomness properties are not good enough. In this paper, we improved LBlock-s key schedule algorithm to enhance its randomness properties against high correlation keys. The result show that our improve algorithm has produced lower correlation keys than LBlock-s in subkeys level, bytes level as well as bit level. On the other hand, our comparation of execution time of both key schedule algorithm shows that even our improved key schedule algorithm is more complex than LBlock, but their execution time has not significant gap.
Sign-in/Register to access full text options 
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.
