Dr. Aysegul Ihsan Toklu

Dr. Aysegul Ihsan Toklu

Information technologies engineering, Selçuk University, Konya, Turkey (Türkiye)
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 March 2024 in Multimedia Tools and Applications
Verified
Journal Article
Open access
PDF file
Dr. Aysegul Ihsan TokluDr. Aysegul Ihsan Toklu
Dr. Aysegul Ihsan Toklu
NDNurettin Doğan
Nurettin Doğan
This study introduces a cutting-edge image encryption algorithm aimed at elevating security standards. The Pan-Tompkins Algorithm (PTA) for key generation is proposed for the first time in this study. Additionally, employing steganography through the Least Significant Bit (LSB) method for embedding keys within the encrypted image enhances secure key distribution, thereby fortifying the encryption process. On the other hand, the integration of advanced algorithms, such as Zigzag scanning, the Affine Image Encryption Algorithm (AA), and the Vigenere Image Encryption Algorithm (VA), constitutes the fundamental innovation of the proposed image encryption algorithm. The proposed algorithm is named PanAAVA:Affine Algorithm and Vigenere Algorithm Encryption with PTA-Based Key Generation. The PanAAVA algorithm ensures unparalleled security by encrypting the positions and values of pixels using AA and VA. Notably, using PTA for key generation marks a distinctive and new key generation method feature of the algorithm. To assess the effectiveness of the PanAAVA, a comprehensive comparative analysis is conducted against well-established encryption methodologies, including Lena, Baboon, Airplane, and Pepper.The PanAAVA demonstrates exceptional proficiency in histogram analysis. The PanAAVA demonstrates a Unified Average Changing Intensity (UACI) of 33.4044%. Additionally, the Number of Pixels Change Rate (NPCR) is measured at 99.7442%, showcasing the algorithm’s effectiveness in inducing significant pixel changes. The proposed algorithm’s Mean Square Error (MSE) is calculated at 3.20679E5%. The proposed algorithm’s Peak Signal to Noise Ratio (PSNR) is recorded at 9.512475. The Key Space Size of the proposed algorithm is measured at 2209. Regarding correlation analysis, the PanAAVA achieves a high correlation score of 7.9996. The proposed algorithm successfully passes the National Institute of Standards and Technology (NIST) analysis, demonstrating a remarkably strong correlation close to 0 and a Structural Similarity Index Measure (SSIM) of 0.9977. Furthermore, regarding quantum communication, the proposed algorithm maintains stable key rates of 47.5 ± 0.8 kHz during the day and 50.9 ± 0.7 kHz at night. Additionally, PanAAVA achieves low Quantum Bit Error Rate (QBER) values of 4.77 ± 0.02, ensuring reliable and secure communication. The PanAAVA also demonstrates robust asymmetries at 49.81 ± 0.02 and 50.14 ± 0.03 for a crystal length of 20 mm. highlighting PanAAVA’s adaptability and effectiveness in different scenarios. PanAAVA outperforms other encryption algorithms concerning performance measurements and comparisons. In conclusion, the PanAAVA emerges as a beacon of superior security capabilities and innovation in image encryption, showcasing the potential to redefine standards in the field.

3 September 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
Dr. Aysegul Ihsan TokluDr. Aysegul Ihsan Toklu
Dr. Aysegul Ihsan Toklu
NDNurettin Doğan
Nurettin Doğan

8 March 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
TSTahir Sag
Tahir Sag
Dr. Aysegul Ihsan TokluDr. Aysegul Ihsan Toklu
Dr. Aysegul Ihsan Toklu

11 September 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Dr. Aysegul Ihsan TokluDr. Aysegul Ihsan Toklu
Dr. Aysegul Ihsan Toklu
TSTahir SAĞ
Tahir SAĞ
In this study, the Binary Puma Optimizer (BPO) is introduced as a novel binary metaheuristic. The BPO employs eight Transfer Functions (TFs), consisting of four S-shaped and four V-shaped mappings, to convert the continuous search space of the original Puma Optimizer into binary form. To evaluate its effectiveness, BPO is applied to two well-known combinatorial optimization problems: the 0-1 Knapsack Problems (KPs) and the Uncapacitated Facility Location Problem (UFLP). The solver tailored for KPs is referred to as BPO1, while the solver for the UFLP is denoted as BPO2. In the UFLP experiments, only TFs are integrated into the solutions. Conversely, in the 0-1 KPs experiment, the additional mechanisms are (i) greedy-based population strategies; (ii) a crossover operator; (iii) a penalty algorithm; (iv) a repair algorithm; and (v) an improvement algorithm. Unlike KPs, the UFLP has no infeasible solutions, as facilities are assumed to be uncapacitated. Unlike KPs, the UFLP has no capacity constraints, as facilities are assumed to be uncapacitated. Thus, violations cannot occur, making improvement strategies unnecessary, and the BPO2 depends solely on TFs for binary adaptation. The proposed algorithms are compared with binary optimization algorithms from the literature. The experimental framework demonstrates the versatility and effectiveness of BPO1 and BPO2 in addressing different classes of binary optimization problems.

1 January 2023 in Pamukkale University Journal of Engineering Sciences
Verified
Journal Article
Closed access
TSTahir Sag
Tahir Sag
Dr. Aysegul Ihsan TokluDr. Aysegul Ihsan Toklu
Dr. Aysegul Ihsan Toklu
Pamukkale University Journal of Engineering Sciences

1 January 2023 in Pamukkale University Journal of Engineering Sciences
Verified
Journal Article
Closed access
EBEMİNE BAŞ
EMİNE BAŞ
Dr. Aysegul Ihsan TokluDr. Aysegul Ihsan Toklu
Dr. Aysegul Ihsan Toklu
Pamukkale University Journal of Engineering Sciences