Enter your keyword

2-s2.0-84964937570

[vc_empty_space][vc_empty_space]

Modification of key scheduling for security improvement in XTEA

Arsalan O.a,b, Kistijantoro A.I.a

a School of Electrical Engineering and Informatics, Institute of Technology Bandung, Bandung, Indonesia
b Faculty of Computer Science, Sriwijaya University, Palembang, Indonesia

[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2015 IEEE.XTEA algorithm has been used as one of the solutions for securing digital data based on cryptosystem. The algorithm was developed by researchers from the University of Cambridge UK known as a lightweight, low cost and fast algorithm. However, such an attack impossible differential and related-key differential proved able to break through to the XTEA algorithm. XTEA algorithm weaknesses in the key scheduling used to establish the characteristics of the attack so as to find the pieces of the key are used. In this research, security improvement strategies developed by modifying the scheduling algorithm XTEA key into the key dynamic scheduling. This strategy proved to be able to produce different patterns of diffusion of derivative input bits for each use different keys. In addition, the key scheduling modification strategy is capable of producing good-value diffusion bits (over 50% of the total input 64-bit) 10 times more than the original algorithm XTEA. With the level of the round sub key distribution difference reaches 100%, it is certain that the process of guessing the right key value for each round will be very difficult.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Dynamic scheduling,Fast algorithms,improvement,Key scheduling,Original algorithms,Security improvement,University of Cambridge,XTEA[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]cryptography,improvement,key,scheduling,XTEA[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ICTS.2015.7379904[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]