FAFırat Artuğer

Fırat Artuğer

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Fırat Artuğer has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A new key generator algorithm based on sine map and SHA-3 for image encryption

    by Fırat Artuğer, Fatih Özkaynak

    In recent years, the need for secure cryptographic keys for various purposes has been constantly increasing. One of these areas is undoubtedly image encryption. In this study, a new key generation algorithm has been developed for use in image encryption algorithms. The proposed generator has a hybrid structure based on the chaotic sine map and the SHA-3 algorithm. It is aimed to produce strong keys by using the benefits of these two structures. To do this, first, bit sequences of the desired length are generated using the basic parameters of the sine map. Then, bit sequences of the same length are obtained using the SHA-3 algorithm. These two bit sequences are then subjected to an XOR operation to generate key values ​​of the desired length. With this structure, 3 different bit sequences of 1 million length were produced. All of these bit sequences successfully passed NIST SP 800 − 22 tests. This key value obtained in this study has been successfully applied to a new image encryption algorithm. The results of the study demonstrate that the proposed algorithm meets important cryptographic criteria such as information entropy, correlation-histogram analysis, NPCR, and UACI values. In addition, the simple and fast structure of the algorithm in key generation was the most important difference from other studies.


  • Open Access

    Innovative image encryption approach based on bitwise XOR high nonlinear S-boxes and random permutation

    by Fırat Artuğer

    With today's developing technologies, the need for new image encryption algorithms to encrypt images is inevitable. In this study, an innovative image encryption algorithm is proposed. The proposed algorithm first XORs each layer of the image with a unique and strong new key. Each layer is then subjected to a random permutation process. Each of the encrypted layers obtained here is finally passed through a new s-box structure with a high nonlinearity value. After these processes, all layers are combined to obtain an encrypted image. Thus, XOR and s-box confusion meet the criteria, while random permutation meets the diffusion criteria. In this study, both key and s-box structures were originally obtained with a chaotic Gaussian map. The outputs of the chaotic map were converted into bit sequences and five different sequences with a length of 1 million were obtained. All these arrays have successfully passed all NIST SP 800-22 tests. On the other hand, the proposed s-box structures surpassed many studies with nonlinearity values of 108, 108.5, and 108.75. The images were successfully encrypted with the proposed algorithm, and the encrypted images successfully completed tests such as NPCR-UACI, information entropy, histogram analysis, and correlation analysis. It is thought that this study will make many contributions to the fields of s-box development, random number generation, and image encryption.


  • Open Access

    İkame Kutularının Lineer Olmama Değerini Optimize Etme

    by Fırat Artuğer

    Şifreleme algoritmalarında en önemli gereksinimlerden bir tanesi karıştırma olarak adlandırılmaktadır. Bu nedenle şifrelenecek verinin etkin bir şekilde karıştırılması gerekmektedir. İkame kutusu (s-box), bu gereksinimi sağlayan en önemli yapılardan bir tanesidir. Bu yapının en önemli özelliklerinden biri olan lineer olmama değeri ne kadar yüksek olursa karıştırmayı o kadar sağlıklı bir şekilde yerine getirecektir. İkame kutularının elde edilmesinde birçok teknik kullanılmaktadır. Bu tekniklerden en çok kullanılan, optimizasyon tekniğidir. Bu teknikte, başlangıçta genellikle kaos yardımıyla bir s-box elde edilir. Daha sonra bir optimizasyon tekniği kullanılarak elemanların konumları değiştirilir. Uygunluk değeri olarak lineer olmama kriteri kullanılır. Yeni konumlandırmalardan sonra lineer olmama değeri arttığında s-box yapısı güncellenmektedir. Bu çalışmada öncelikle s-box yapılarında lineer olmama değerinin nasıl optimize edildiği açıklanmıştır. Daha sonra sinüs kosinüs algoritması kullanılarak bir s-box optimize edilmiştir. Elde edilen s-box yapısının, 500 iterasyon sonunda lineer olmama değeri 108 olarak gözlemlenmiştir. Ayrıca bir s-box yapısının diğer performans kriterleri de açıklanmıştır.


  • Open Access

    A New Cryptographic Key Planning Algorithm Based on Blum Blum Shub

    by Songül Karakuş, Fırat Artuğer

    The Blum Blum Shub (BBS) algorithm is one of the known powerful pseudo random number generators. This algorithm can be used for key generation. BBS is basically based on the product of two large prime numbers and a seed value. The selection of these values is a critical issue. In this study, a new approach is proposed to overcome this problem. In the proposed approach, a prime number pool is first created. At this point, the user sets a start and end value. The primes in this range are generated and stored in an array. Then, two primes are randomly selected from this prime number pool with chaotic maps. The positions of these prime numbers in the array are recorded. The seed value is taken as the sum of the positions of these two primes. In other words, the parameters to be selected will be randomly selected in the ranges that the user will enter at that moment. In this study, two random bit sequences were obtained in this way. These sequences are 1 million bits long. NIST SP 800-22 tests were applied to these sequences and the sequences successfully completed all tests.


  • Open Access

    Strong s-box construction approach based on Josephus problem

    by Fırat Artuğer

    There are two basic requirements for symmetric encryption algorithms. The first of these is diffusion. The second and most important is confusion. In these algorithms, this requirement is usually met by s-box structures. Therefore, s-box structures must be strong. So, a cryptographically good s-box will make the encryption algorithm difficult to crack. However, obtaining a strong s-box is a rather difficult problem. In this study, Josephus circle logic is used to solve this problem. Initially, with a random s-box structure, the elements are replaced according to their Josephus positions, and the s-box is made stronger. In the proposed algorithm, according to the Josephus logic, the elements that kill each other are replaced and this process continues until one element remains. The last 30 surviving elements are replaced with all elements. In this way, three different s-boxes were obtained. In two of them, the nonlinearity value was 110.5, and in one of them, the nonlinearity value was 110.75. Fixed points in the proposed s-box structures were identified and eliminated. In addition, it has been proven because of the analysis that the obtained s-box structures also meet other cryptographic requirements. In addition to leaving behind most studies in the literature, the proposed method will also provide strong s-box structures for encryption algorithms to be built in the future.


  • Open Access

    A new chaotic system and its practical applications in substitution box and random number generator

    by Fırat Artuğer, Fatih Özkaynak

    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.


  • Open Access

    Kriptografik Yapılar için Seçmeli Kaotik Permütasyonlar Tabanlı Yeni bir S-box Üretme Algoritması

    by Fırat Artuğer

    Kriptografi, güvenli olmayan ağlar üzerinden iletilen verilerin korunması için algoritmalar tasarlamayı amaçlamaktadır. Bu algoritmalar, verileri şifreler ve üçüncü kişiler tarafından ele geçirilse bile, veriyi anlaşılmaz hale getirir. S-box, algoritmada karıştırma adı verilen temel gereksinimlerden birini sağlamaktadır. Lineer olmama değeri yüksek bir s-box yapısı, çeşitli saldırılarına karşı güvenliği oldukça arttırmaktadır. Bu nedenle, bir şifreleme algoritmasında s-box oldukça hayati bir önem taşımaktadır. Literatüre bakıldığında kaos tabanlı s-box yapıları sıklıkla kullanılmaktadır. Ancak kaos ile üretilen s-box ‘ların lineer olmama değeri düşüktür. Bu makalede, bu problemin üstesinden gelmek için yeni bir algoritma önerilmiştir. Önerilen yöntemde öncelikle herhangi bir kaotik harita yardımıyla bir s-box üretilir. Daha sonra bu s-box ‘da yine aynı kaotik harita ile seçilmiş iki elemanın yeri değiştirilerek lineer olmama değeri kontrol edilir. Bu değer arttığında s-box güncellenir. Bu şekilde sadece 100 yineleme sonucunda lineer olmama değeri 107.5 olan bir s-box üretilmiştir. Bu değer literatürdeki birçok çalışmayı geride bırakmaktadır.