Publication Search

This community service activity aims to increase the understanding of students at State Senior High School 2 Mataram regarding information security by introducing the concepts of coding and cryptography in digital messages. The rapid use of messaging applications among teenagers makes students increasingly vulnerable to cyber threats, necessitating education on how data protection works in online communication. This program is implemented using a descriptive method consisting of planning, implementation, and evaluation stages. The material covered includes basic cryptography concepts, end-to-end encryption mechanisms, and the practical process of the Diffie–Hellman key exchange thru the interactive simulation "Alice and Bob." Learning is designed contextually and participatively so that students can connect theory with the digital applications they use every day. The evaluation results showed an improvement in students' understanding, reflected in their active participation, ability to answer questions, and adequate post-test scores. This activity not only strengthens digital security literacy but also raises students' awareness of the importance of protecting personal data in online communication. This program is expected to be the beginning of more sustainable digital security learning development in the school environment.

This community service activity aims to increase the understanding of students at State Senior High School 2 Mataram regarding information security by introducing the concepts of coding and cryptography in digital messages. The rapid use of messaging applications among teenagers makes students increasingly vulnerable to cyber threats, necessitating education on how data protection works in online communication. This program is implemented using a descriptive method consisting of planning, implementation, and evaluation stages. The material covered includes basic cryptography concepts, end-to-end encryption mechanisms, and the practical process of the Diffie–Hellman key exchange thru the interactive simulation "Alice and Bob." Learning is designed contextually and participatively so that students can connect theory with the digital applications they use every day. The evaluation results showed an improvement in students' understanding, reflected in their active participation, ability to answer questions, and adequate post-test scores. This activity not only strengthens digital security literacy but also raises students' awareness of the importance of protecting personal data in online communication. This program is expected to be the beginning of more sustainable digital security learning development in the school environment.

Advances in technology and computers are utilized in various fields of contemporary applications, especially in cryptography and data security in graph theory applications. By understanding the concepts of graph theory, researchers and developers can design cryptographic algorithms that are stronger, more efficient and resistant to attacks. One of the cryptographic applications that has been implemented is the XNOR algorithm. This algorithm has been applied to encryption and decryption as well as the use of stream ciphers. By using 64 bits, the XNOR algorithm can expand encryption and decryption capabilities and increase the security of encrypted data. In this research, an analysis was carried out regarding information encryption and decryption algorithms with the application and development of the XNOR gate logic circuit method in Boolean algebra and graph theory. This research uses the example of the word MATH, which can be changed into a code or password and vice versa to secure information that you want to keep secret. Apart from that, an analysis of the graph formation of each character in the word MATH was also carried out using Python which produced semi-Euler and Hamilton graphs  

The rapid advancement of quantum computing has significantly impacted data security, as classical cryptographic algorithms such as RSA and ECC are increasingly vulnerable to quantum attacks. This study aims to evaluate the performance of classical and post-quantum cryptographic algorithms in a quantum simulation environment, focusing on stability, efficiency, and computational time. The research method employed experimental simulations using Qiskit, where cryptographic algorithms were modeled into quantum circuits and tested across varying qubit sizes of 128, 256, 512, and 1024. The simulation results indicate that classical algorithms face substantial limitations, with exponentially increasing computational time and drastically reduced stability beyond 512 qubits. In contrast, post-quantum algorithms demonstrated superior performance, maintaining high stability up to 1024 qubits, achieving greater quantum efficiency, and showing resilience against quantum attacks such as Shor’s and Grover’s algorithms. These findings highlight the urgent need to transition toward post-quantum cryptography as a more adaptive and reliable approach to safeguarding data in the quantum era. Although post-quantum algorithms still face certain challenges, such as larger key sizes and slightly higher computational costs at smaller scales, their overall benefits are far more significant in ensuring sustainable information security. Therefore, adopting post-quantum cryptography represents a strategic step that must be prioritized to address the evolving risks posed by quantum computing technologies.

Quantum computing has emerged as a revolutionary paradigm, holding immense potential to solve complex problems that classical computing struggles to address. This study explores the application of quantum computing in cryptography, with a specific focus on two major quantum algorithms: Shor’s algorithm for large number factorization and Grover’s algorithm for unstructured database searching. The main objective of this research is to compare the performance of these quantum algorithms with classical cryptographic methods in terms of computational efficiency and time. Shor’s algorithm, which can factorize large numbers in polynomial time, presents a significant threat to the security of public-key cryptosystems such as RSA, which rely on the difficulty of factoring large numbers. On the other hand, Grover’s algorithm offers a quadratic speedup for searching unstructured databases, making it highly relevant for symmetric key cryptography systems like AES. In this study, simulations of both algorithms were conducted using quantum simulators to assess their speed and effectiveness in solving cryptographic challenges. The results demonstrate that quantum algorithms significantly reduce the computation time compared to classical methods, with Shor’s algorithm efficiently solving factorization problems and Grover’s algorithm accelerating key searching processes. However, while these quantum algorithms show promise in improving cryptographic systems, the implementation of large-scale quantum computers remains a challenge. This research highlights the potential of quantum computing to revolutionize data security and underscores the need for further development in quantum algorithms and the transition to quantum-resistant cryptographic systems to safeguard against the threat posed by quantum computers.