SKEMA ENKRIPSI BERBASIS GRAF SUN, BIPARTIT, DAN BINTANG DENGAN SUBSTITUSI DAN PERMUTASI

Ardha Carlinda Putri, NIM.: 22106010050 (2026) SKEMA ENKRIPSI BERBASIS GRAF SUN, BIPARTIT, DAN BINTANG DENGAN SUBSTITUSI DAN PERMUTASI. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

	Text (SKEMA ENKRIPSI BERBASIS GRAF SUN, BIPARTIT, DAN BINTANG DENGAN SUBSTITUSI DAN PERMUTASI) 22106010050_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version Download (7MB)
	Text (SKEMA ENKRIPSI BERBASIS GRAF SUN, BIPARTIT, DAN BINTANG DENGAN SUBSTITUSI DAN PERMUTASI) 22106010050_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf - Published Version Restricted to Registered users only Download (17MB) | Request a copy

Abstract

The development of modern computing capabilities and the emergence of various new threats have encouraged exploration of new approaches in cryptographic algorithm design. One of the innovations that has developed is the use of graph theory as the basis for algorithm formation. However, one of the graph-based encryption schemes that is the focus of this research still has several limitations, particularly in terms of key space, diffusion mechanisms, and algorithm consistency. Based on this, the problem formulation in this study is how to develop consistent encryption and decryption algorithms on sun graphs, bipartite graphs, and star graphs by improving their security and key space aspects. This study aims to examine and develop a symmetric cryptographic encryption scheme based on these three types of graphs. The method used is a literature study with modifications to the algorithm structure. The development was carried out using the Vigenere cipher as a substitution method to expand the key space and a permutation cipher as a diffusion mechanism to strengthen message confidentiality. The results of the study show that the developed encryption scheme has a wider key space and is polyalphabetic, making it more resistant to frequency analysis. In addition, adjustments to the encryption rules result in a clearer, more consistent algorithm flow that still satisfies the invertibility property. This development can be an alternative approach in the design of graph-based symmetric cryptography schemes and serve as a basis for further research in the development of other graph-based cryptography algorithms.

Share this knowledge with your friends :

Actions (login required)

View Item