Sherif H. Abdel Haleem, A. Radwan, S. Abd-El-Hafiz
{"title":"A chess-based chaotic block cipher","authors":"Sherif H. Abdel Haleem, A. Radwan, S. Abd-El-Hafiz","doi":"10.1109/NEWCAS.2014.6934068","DOIUrl":null,"url":null,"abstract":"This paper presents a new and efficient block cipher encryption system, which includes confusion as well as diffusion processes. While the confusion process is based on the Lorenz chaotic generator, the diffusion process is chess-based. By utilizing the chess horse movement rules, the diffusion process increases the encryption complexity and improves the differential attack measures. Furthermore, combining chaotic and chess-based algorithms increases the length of the encryption key and, hence, makes brute force attacks infeasible. The encryption system is analyzed using miscellaneous evaluation criteria such as pixel correlation coefficients, differential attack measures, histograms and the NIST statistical test suite. Key sensitivity analysis is also performed and the mean square error and entropy measures are calculated. In addition, several examples are presented for different block sizes showing promising results.","PeriodicalId":216848,"journal":{"name":"2014 IEEE 12th International New Circuits and Systems Conference (NEWCAS)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 12th International New Circuits and Systems Conference (NEWCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEWCAS.2014.6934068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
This paper presents a new and efficient block cipher encryption system, which includes confusion as well as diffusion processes. While the confusion process is based on the Lorenz chaotic generator, the diffusion process is chess-based. By utilizing the chess horse movement rules, the diffusion process increases the encryption complexity and improves the differential attack measures. Furthermore, combining chaotic and chess-based algorithms increases the length of the encryption key and, hence, makes brute force attacks infeasible. The encryption system is analyzed using miscellaneous evaluation criteria such as pixel correlation coefficients, differential attack measures, histograms and the NIST statistical test suite. Key sensitivity analysis is also performed and the mean square error and entropy measures are calculated. In addition, several examples are presented for different block sizes showing promising results.