Yazarlar
Yayınlar
- MakaleAçık Erişim2025Scopus SJRQ1A novel s-box generation method based on metastable inducing over FPGA for block ciphers
Garipcan, Ali Murat; Aydın, Yılmaz; Özkaynak, Fatih
Substitution boxes (s-boxes) providing the nonlinearity property are fundamental components of modern encryption systems. The security of these systems directly depends on the quality of the s-boxes ensuring a high level of resistance to advanced attacks. Although there is no perfect method in the literature, improving the cryptographic properties of s-boxes, such as nonlinearity and differential independence remains an important area of interest for many researchers. In this paper, we propose a new s-box generation method based on the reinforcement of the randomness obtained from the metastable states of the R-S latch. In the proposed method, a Field Programmable Gate Array (FPGA) chip is used to obtain design inputs based on physical reality obtained from the hardware level. Design inputs with poor statistical adequacy are transformed into s-boxes by passing them through four different hash functions (Blake2b, Blake2 s, SHA3 and Shake). A total of 333,328 s-boxes are generated with the proposed method for four different scenarios and widely used evaluation metrics such as bijectivity, nonlinearity (NL), strict avalanche criteria (SAC), bit independence criteria (BIC), differential probability (DP) and linear probability (LP) are considered for the analysis. Taking into account these metric values, the study also presents a detailed performance comparison of the proposed s-boxes with recent studies from the last 5 years in the literature. The fact that the nonlinearity degree of 75 % of the produced s-boxes is higher than 103, which is the average limit value in the literature, also confirms the method's efficiency, proven reliable by the analysis results. When all these results are evaluated together, they confirm that the proposed method is highly effective in generating robust s-boxes and that these s-boxes can be reliably used in modern cryptographic systems.
AtıfScopus21WoS23İncele
- MakaleYalnız künye2025Scopus SJRQ2Innovative nonlinear component generator inspired by squirrel search algorithm
Artuğer, Fırat
The most used approach for data encryption is block cipher. One of the most important structures for block cipher algorithms is undoubtedly s-boxes. The s-box structure used in the AES algorithm contains 256 values. Therefore, obtaining powerful s-boxes is a rather difficult search problem. Because the search space is very large (256!). In this study, a new method based on squirrel search algorithm (SSA) is proposed to overcome this problem. The proposed method is displacement-based. In an s-box taken at the entrance, stronger s-box structures are sought by changing the location of the elements. The most important innovation in this study is that the elements to be displaced in the s-box were selected with the positioning states of the SSA. The chaotic Gompertz map was used for the initial population. Four different s-boxes were produced with the method developed thanks to the effective positioning states of SSA. As the fitness function, the nonlinearity value, which is the most important evaluation criterion of an s-box structure, was used. The proposed four s-box structures increased up to 110 nonlinearity values after only 4500 iterations. Here, it has been shown that the algorithm can be effective in all s-boxes by generating four different s-boxes. Considering these results, it has been determined that the proposed method gives more effective results than most methods in the literature.
AtıfScopus1WoS1OpenAlex2İncele
- MakaleAçık Erişim2024Scopus SJRQ1A new chaotic system and its practical applications in substitution box and random number generator
Artuğer, Fırat; Özkaynak, Fatih
One of the successful practical applications of chaos theory and nonlinear dynamics is chaos-based cryptology studies. In this study, a new chaotic system is proposed. The proposed chaotic system generator model has a simple algorithmic structure. In addition to, generated chaotic systems have rich dynamics. It has been examined whether this system has potential advantages, especially for information security applications. As a result of the analysis and experimental studies, it is seen that the study makes many contributions to the literature. The simple mathematical generator structure has the potential to reduce computational complexity, which is an important problem for cryptology applications. One of the most comprehensive studies has been realized for chaos-based substitution box designs. 70,000 different substitution box structures have been generated. It has been known that the highest nonlinearity value that can be achieved for designs that transform chaotic system outputs into substitution box structures is 106.75 today. It has been shown that this value may be higher. The new highest nonlinearity value is calculated as 107. Side channel analysis has been examined for substitution box structures with the highest nonlinearity value among the substitution boxes generated in the study. Analysis results show that the proposed new substitution box structures may have an advantage for application-oriented attacks. Among the generated substitution box structures, 289 substitution box structures with a nonlinearity value of 106 and above are presented as a public dataset for researchers to use. In addition, 3 different random sequences with a length of 1 million-bit were produced with the proposed map, and the NIST SP 800–22 test was applied. Test results for all datasets were successful. In this way, the proposed map can also be used as a random number generator.
AtıfScopus13İncele
- MakaleYalnız künye2024Scopus SJRQ1A novel algorithm based on DNA coding for substitution box generation problem
Artuğer, Fırat
Substitution boxes are very important for cryptographic structures. But getting an 8-bit strong s-box is a difficult problem. To address this problem, a new approach is proposed in this study. DNA chains are used in the proposed approach. First of all, a weak s-box is obtained with the help of a chaotic map. Then, a DNA chain is formed with the same chaotic map. In this study, 2000-long DNA chains were produced. Then, two random values consisting of four components are determined from these DNA chains, and these values are addressed to the s-box structure. By changing the places of these values, the s-box structure is improved up to a certain iteration. In this study, 10,000 iterations were examined, and three different strong s-boxes were obtained by using three different DNA chains. The nonlinearity values of these s-box structures were observed as 110.25, 110.5, and 110.75, respectively. The proposed study has proven to work effectively with effective results in three different chains. In addition, it has been proven as a result of the analysis that the proposed s-box structures also have other cryptographic features. The proposed algorithm has surpassed many s-box generation philosophies in the literature. In addition, the proposed algorithm will provide serious gains to cryptographic structures that will be developed in the future.
AtıfScopus21WoS22OpenAlex24İncele
- Kitap BölümüAçık Erişim2023Scopus SJRQ4The Effects of Knowledge Extraction Approaches on Cryptanalysis Studies and Analysis of the Success of Chaos-Based Countermeasures
Bürhan, Yücel; Özkaynak, Fatih
Each new approach and scientific progress provides many advantages and innovations from theory to practice yet, its disadvantages should be evaluated comprehensively from different perspectives. In this study, the effects of knowledge extraction approaches on the cryptanalysis process have been evaluated. It is known that the secret key of the encryption algorithm can be obtained by using knowledge extraction approaches, especially with application oriented attacks such as side channel analysis. It is known that chaotic masks can be used as a countermeasure to prevent the success of these attacks. In this study, side-channel analyzes of the chaos-based substitution box structures that have been proposed in recent years have been carried out. The side channel analysis results of the existing studies in the literature have been carried out for the first time in this study. The results obtained showed that the approaches in the field of knowledge extraction should be handled more comprehensively in the cryptanalysis processes, and also pointed out that a new evaluation criterion should be analyzed for future studies for chaos-based design studies.
AtıfScopus2OpenAlex2İncele
- MakaleAçık Erişim2021Scopus SJRQ1An effective method to improve nonlinearity value of substitution boxes based on random selection
Artuğer, Fırat; Özkaynak, Fatih
In today's digital society, new design alternatives are needed for substitution box structures, which has critical importance in developing secure information systems that are resistant to algebraic and application attacks, as new attacks negatively affect designs based on mathematical transformations. Although random selection-based substitution box structures are a good alternative against algebraic and application attacks, the low value of nonlinearity criterion is an important problem. Solution suggestions using optimization algorithms have been proposed to address this problem. “Information Sciences 523 (2020) 152–166” is the study that reached the highest nonlinearity value based on optimization algorithms to date. However, the high computational costs of optimization algorithms are another challenge that must be overcome. In this study, it has been shown that the nonlinearity values of random (chaotic) selection substitution box structures can be improved as much as mathematically based designs by using a method that is too simple to compare with optimization algorithms. It has been shown that the nonlinearity value can be improved up to 110 for random selection-based substitution box designs. Although this nonlinearity value is the highest achievable value in the literature based on the random selection principle, the fact that it requires only 2×255×255 processes in the worst case has been evaluated as an important success of the proposed method compared to other design approaches. Other advantages of the proposed method are that the improved substitution box structures are resistant to side-channel attacks, simple structure, easy hardware implementation, and successful results in practical applications such as image encryption. It is believed that all these results will be a motivation for new post-processing techniques to be designed in the future for random selection-based substitution box designs.
AtıfScopus42WoS30OpenAlex42İncele
- MakaleAçık Erişim2020Scopus SJRQ2A novel method for performance improvement of chaos-based substitution boxes
Artuğer, Firat; Özkaynak, Fatih
Symmetry plays an important role in nonlinear system theory. In particular, it offers several methods by which to understand and model the chaotic behavior of mathematical, physical and biological systems. This study examines chaotic behavior in the field of information security. A novel method is proposed to improve the performance of chaos-based substitution box structures. Substitution box structures have a special role in block cipher algorithms, since they are the only nonlinear components in substitution permutation network architectures. However, the substitution box structures used in modern block encryption algorithms contain various vulnerabilities to side-channel attacks. Recent studies have shown that chaos-based designs can offer a variety of opportunities to prevent side-channel attacks. However, the problem of chaos-based designs is that substitution box performance criteria are worse than designs based on mathematical transformation. In this study, a postprocessing algorithm is proposed to improve the performance of chaos-based designs. The analysis results show that the proposed method can improve the performance criteria. The importance of these results is that chaos-based designs may offer opportunities for other practical applications in addition to the prevention of side-channel attacks.
AtıfScopus55WoS44OpenAlex56İncele
