Simulasi Kuantum untuk Optimasi Algoritma Kriptografi pada Era Komputasi Modern

Abstract

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.