Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of New Trends in Sciences

Simulasi Kuantum untuk Optimasi Algoritma Kriptografi pada Era Komputasi Modern

Firdaus Firdaus, Teguh Arifianto

Published May 31, 2024• 0 citations
Publisher

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.

DOI
10.59031/jnts.v2i2.794

Related papers

Quantum Computing in Cryptography: Challenges and Post-Quantum Solutions

Ritesh K. Malhotra1 Shalini P. Deshmukh2, Pranav R. Chatterjee3

The rapid advancement of quantum computing threatens to undermine the security foundations of modern cryptographic systems, particularly those based on integer factorization and discrete logarithm problems. Algorithms such as Shor’s and Grover’s promise exponential or quadratic speedups, rendering RSA, ECC, and certain symmetric schemes vulnerable within the next decade. This paper presents a simulated evaluation of classical cryptographic algorithms against quantum attacks, followed by a performance assessment of post-quantum cryptographic (PQC) schemes—specifically lattice-based, hash-based, and code-based algorithms. A testing framework was developed using a quantum simulator (Qiskit) and a classical benchmarking environment to model potential attack timelines and measure computational efficiency. Results demonstrate that RSA-2048 can be theoretically broken within 8 hours on a 4000-qubit fault-tolerant quantum processor, while ECC-P256 succumbs in less than 4 hours. In contrast, lattice-based schemes such as CRYSTALS-Kyber resisted quantum simulation attacks, maintaining equivalent classical security levels with only a 27% performance overhead. The study also analyzes the trade-offs between key size, encryption/decryption speed, and resistance to quantum attacks. Our findings emphasize the urgent need for migration to NIST-recommended PQC algorithms and provide a decision-support matrix for selecting suitable replacements in government and enterprise systems.

•Jun 20, 2025•0 citations

Quantum Computing and Cryptography: Security Challenges and Post-Quantum Solutions

Alok Priyadarshi, Raushan Kumar, Kumar Soumya +2 more

Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.

International Conference on Secure Information Systems and Technologies (ICSIST)•Aug 1, 2026•0 citations

Penerapan Komputasi Kuantum dalam Kriptografi Modern dan Sistem Keamanan Digital

Rudolf Sinaga, Uswatun Kasanah

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.

Journal of New Trends in Sciences•Nov 30, 2023•0 citations

How Effective are Classical Cryptographic Protocols Against Early Quantum Decryption Attempts?

Zachary Carruthers, Victor A. Clincy

The advent of quantum computing poses a significant challenge to classical cryptographic protocols, threatening to undermine the security of widely used security systems like RSA, ECC, and AES. This paper investigates the vulnerabilities of traditional public-key and symmetric cryptographic schemes to quantum decryption techniques, such as Shor’s and Grover’s algorithms, while analyzing the efficacy of post-quantum cryptography (PQC) as a mitigation strategy. Through a review of current literature and simulations of quantum attacks on legacy protocols, this research identifies critical gaps in preparedness and evaluates emergent quantumresistant solutions. The findings highlight the immediate risks of “store now, decrypt later” attacks, emphasizing the importance of transitioning to PQC algorithms. Despite promising advances, challenges related to performance, interoperability, and standardization remain. This study concludes with a call for collaborative efforts in research, policy development, and widespread adoption of quantum-safe practices to ensure the resilience of digital communications in the quantum era.

International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)•Oct 16, 2025•1 citation

Quantum cryptography and post-quantum security: current state, challenges, and strategic directions

Aureliu Zgureanu, Victor Andronatiev

Quantum cryptography is a new field of research that tries to resolve the critical security concerns brought by quantum computing. There is an increasing effort to construct quantum-safe cryptographic solutions due to the threat that quantum algorithms, especially Shor’s and Grover’s, pose to popular cryptographic systems. Traditional cryptographic methods like RSA and ECC are based on problems that will be efficiently tackled by quantum computers, putting them at risk in a post-quantum world. Also, symmetric cryptography, despite being stronger against that threat, faces its own challenges as well, especially from Grover’s algorithm, which effectively slashes the key length by half, increasing the necessary key size for maintaining security. The rise of quantum technologies has come with additional risks such as cyber threats and security vulnerabilities, therefore creating a need for research in quantum as well as post-quantum cryptography. Quantum cryptography particularly Quantum Key Distribution (QKD) exploits quantum mechanical phenomena to safeguard the exchange of cryptographic keys with information-theoretic security. Eavesdropping in QKD is always detectable. However, due to stringent hardware requirements, QKD is limited for broader practical use. Meanwhile, post-quantum cryptography (PQC) seeks to devise traditional algorithms for cryptography which will continue to remain secure under attacks from quantum computers. Such algorithms include lattice-based cryptography and code-based cryptography which, among others, are being standardized by NIST. This paper examines the current status of quantum cryptography alongside the vulnerabilities present in traditional systems as well as the efforts dedicated to implementing post-quantum algorithms. It covers the standardization and implementation challenges while also outlining prospective future research avenues aimed at reinforcing the cryptographic infrastructure in the era of quantum computing.

•Nov 1, 2025•1 citation

Comparative Study of Cryptographic Algorithms in Post Quantum Computing Landscape

Anshuman Sahoo, Indira Kumar A K, Shinu M. Rajagopal

As the advent of quantum computing looms, the cryptographic landscape faces unprecedented challenges that could render traditional algorithms like AES, RSA, and ECC vulnerable. This paper delves into a comparative study of these classical cryptographic algorithms, examining their foundational principles and evaluating their resilience against quantum computing threats, particularly Shor’s and Grover’s algorithms. Through a combination of theoretical analysis and practical simulations, we assess the potential weaknesses and strengths of AES, RSA, and ECC in the post-quantum era. The study highlights the need for quantum-resistant cryptographic methods and explores how current algorithms can be adapted or replaced to withstand the sophisticated computational capabilities of quantum computers. By bridging the gap between classical and quantum cryptography, this research offers crucial insights into the future of secure digital communication, underscoring the urgency for innovation in cryptographic practices to safeguard data in an increasingly quantum-dominated world.

International Conference on Data Intelligence and Cognitive Informatics (ICDICI)•Nov 18, 2024•10 citations
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.
The rapid advancement of quantum computing threatens to undermine the security foundations of modern cryptographic systems, particularly those based on integer factorization and discrete logarithm problems. Algorithms such as Shor’s and Grover’s promise exponential or quadratic speedups, rendering RSA, ECC, and certain symmetric schemes vulnerable within the next decade. This paper presents a simulated evaluation of classical cryptographic algorithms against quantum attacks, followed by a performance assessment of post-quantum cryptographic (PQC) schemes—specifically lattice-based, hash-based, and code-based algorithms. A testing framework was developed using a quantum simulator (Qiskit) and a classical benchmarking environment to model potential attack timelines and measure computational efficiency. Results demonstrate that RSA-2048 can be theoretically broken within 8 hours on a 4000-qubit fault-tolerant quantum processor, while ECC-P256 succumbs in less than 4 hours. In contrast, lattice-based schemes such as CRYSTALS-Kyber resisted quantum simulation attacks, maintaining equivalent classical security levels with only a 27% performance overhead. The study also analyzes the trade-offs between key size, encryption/decryption speed, and resistance to quantum attacks. Our findings emphasize the urgent need for migration to NIST-recommended PQC algorithms and provide a decision-support matrix for selecting suitable replacements in government and enterprise systems.
Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.
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.
The advent of quantum computing poses a significant challenge to classical cryptographic protocols, threatening to undermine the security of widely used security systems like RSA, ECC, and AES. This paper investigates the vulnerabilities of traditional public-key and symmetric cryptographic schemes to quantum decryption techniques, such as Shor’s and Grover’s algorithms, while analyzing the efficacy of post-quantum cryptography (PQC) as a mitigation strategy. Through a review of current literature and simulations of quantum attacks on legacy protocols, this research identifies critical gaps in preparedness and evaluates emergent quantumresistant solutions. The findings highlight the immediate risks of “store now, decrypt later” attacks, emphasizing the importance of transitioning to PQC algorithms. Despite promising advances, challenges related to performance, interoperability, and standardization remain. This study concludes with a call for collaborative efforts in research, policy development, and widespread adoption of quantum-safe practices to ensure the resilience of digital communications in the quantum era.
Quantum cryptography is a new field of research that tries to resolve the critical security concerns brought by quantum computing. There is an increasing effort to construct quantum-safe cryptographic solutions due to the threat that quantum algorithms, especially Shor’s and Grover’s, pose to popular cryptographic systems. Traditional cryptographic methods like RSA and ECC are based on problems that will be efficiently tackled by quantum computers, putting them at risk in a post-quantum world. Also, symmetric cryptography, despite being stronger against that threat, faces its own challenges as well, especially from Grover’s algorithm, which effectively slashes the key length by half, increasing the necessary key size for maintaining security. The rise of quantum technologies has come with additional risks such as cyber threats and security vulnerabilities, therefore creating a need for research in quantum as well as post-quantum cryptography. Quantum cryptography particularly Quantum Key Distribution (QKD) exploits quantum mechanical phenomena to safeguard the exchange of cryptographic keys with information-theoretic security. Eavesdropping in QKD is always detectable. However, due to stringent hardware requirements, QKD is limited for broader practical use. Meanwhile, post-quantum cryptography (PQC) seeks to devise traditional algorithms for cryptography which will continue to remain secure under attacks from quantum computers. Such algorithms include lattice-based cryptography and code-based cryptography which, among others, are being standardized by NIST. This paper examines the current status of quantum cryptography alongside the vulnerabilities present in traditional systems as well as the efforts dedicated to implementing post-quantum algorithms. It covers the standardization and implementation challenges while also outlining prospective future research avenues aimed at reinforcing the cryptographic infrastructure in the era of quantum computing.
As the advent of quantum computing looms, the cryptographic landscape faces unprecedented challenges that could render traditional algorithms like AES, RSA, and ECC vulnerable. This paper delves into a comparative study of these classical cryptographic algorithms, examining their foundational principles and evaluating their resilience against quantum computing threats, particularly Shor’s and Grover’s algorithms. Through a combination of theoretical analysis and practical simulations, we assess the potential weaknesses and strengths of AES, RSA, and ECC in the post-quantum era. The study highlights the need for quantum-resistant cryptographic methods and explores how current algorithms can be adapted or replaced to withstand the sophisticated computational capabilities of quantum computers. By bridging the gap between classical and quantum cryptography, this research offers crucial insights into the future of secure digital communication, underscoring the urgency for innovation in cryptographic practices to safeguard data in an increasingly quantum-dominated world.