Content uploaded by Ryan McCarroll
Author content
All content in this area was uploaded by Ryan McCarroll on Jul 06, 2024
Content may be subject to copyright.
how can quantum computing break encryption?
Introduction
The rapid advancement of quantum computing poses a significant threat to the security
foundations of modern digital infrastructure. Quantum computers, with their ability to harness
the principles of quantum mechanics, have the potential to revolutionize various fields,
including cryptography [1], [2], [3]. At the heart of this revolution lies the looming challenge
to current encryption methods, which have long been the cornerstone of secure digital
communication and data protection.
Conventional encryption algorithms, such as RSA and Elliptic Curve Cryptography (ECC),
rely on the computational complexity of mathematical problems, such as integer factorization
and discrete logarithms [1], [2]. These problems, which are believed to be intractable for
classical computers, form the basis of the security guarantees offered by these encryption
schemes. However, the emergence of quantum computing presents a formidable challenge to
this assumption [3], [4].
Quantum computers, with their unique ability to exploit quantum phenomena like
superposition and entanglement, can potentially solve these mathematical problems
exponentially faster than their classical counterparts [5], [6]. Shor's algorithm, a quantum
algorithm developed in the mid-1990s, has been shown to efficiently factor large integers and
compute discrete logarithms, rendering RSA and ECC vulnerable to quantum attacks [1], [7],
[8]. Similarly, Grover's algorithm, another prominent quantum algorithm, can enable quantum
computers to find preimages of hash functions, potentially compromising the security of
symmetric-key cryptography [4], [9].
The impending threat posed by quantum computing has prompted the research community
and industry leaders to explore alternative cryptographic solutions capable of withstanding
quantum attacks. This quest has given rise to the field of post-quantum cryptography (PQC),
which encompasses a diverse array of cryptographic algorithms designed to be resilient
against the computational power of quantum computers [4], [10], [11]. These PQC schemes,
such as lattice-based, code-based, and multivariate-based cryptography, aim to provide a
secure alternative to classical encryption methods in the quantum era [4], [12], [13].
Furthermore, the development of quantum key distribution (QKD) has emerged as a
promising approach to secure communication in the face of quantum threats [5], [14], [15].
QKD leverages the fundamental principles of quantum physics to establish secure
communication channels that are resistant to eavesdropping and manipulation, providing an
additional layer of security beyond traditional cryptographic techniques [5], [16].
As the quantum computing landscape continues to evolve, it is crucial to understand the
potential impact of this transformative technology on the cybersecurity landscape and explore
the strategies being developed to address the challenges it poses. The following sections will
delve deeper into the key differences between classical and quantum computing, the specific
vulnerabilities of current encryption methods, and the ongoing efforts to develop
quantum-resistant cryptographic solutions.
Classical vs. Quantum Computing
To fully comprehend the potential impact of quantum computing on encryption, it is crucial to
explore the fundamental differences between classical and quantum computing paradigms.
The traditional computer systems that have underpinned modern cryptography are based on
the principles of classical physics, whereas quantum computers leverage the unique properties
of quantum mechanics to perform computations [5], [6], [10].
Classical computers, the workhorses of the digital age, store and process information in the
form of bits, which can exist in either a "0" or "1" state. These bits are manipulated through a
series of logical operations, executing algorithms that solve complex problems. The security
of classical cryptographic schemes, such as RSA and ECC, relies on the computational
complexity of certain mathematical problems, such as integer factorization and discrete
logarithms [1], [2], [3]. The underlying assumption is that these problems are intractable for
classical computers, even with the most powerful supercomputers available today [7], [8], [9].
In contrast, quantum computers exploit the principles of quantum mechanics, including
superposition and entanglement, to store and process information in the form of quantum bits,
or qubits [5], [6], [10]. Unlike classical bits, qubits can exist in a superposition of "0" and "1"
states, allowing them to represent and process multiple states simultaneously. This quantum
parallelism is the key to the computational power of quantum computers, as it enables them to
perform certain tasks, such as integer factorization and discrete logarithm computation,
exponentially faster than classical computers [1], [4], [7].
The most prominent example of this quantum advantage is Shor's algorithm, a quantum
algorithm developed in the 1990s that can efficiently factor large integers and compute
discrete logarithms [1], [7], [8]. This powerful algorithm, when executed on a large-scale
quantum computer, poses a grave threat to the security of RSA and ECC cryptographic
schemes, which rely on the intractability of these mathematical problems [1], [3], [4].
Additionally, Grover's algorithm, another prominent quantum algorithm, can be used to
perform a quadratic speedup in searching for preimages of hash functions, potentially
compromising the security of symmetric-key cryptography [4], [9]. This vulnerability
highlights the need for a comprehensive reevaluation of the security assumptions underlying
current cryptographic methods in the face of quantum computing [4], [10], [11].
The emergence of quantum computing has thus upended the long-held security guarantees
provided by classical encryption algorithms, leading to a pressing need for the development of
new cryptographic approaches capable of withstanding the computational power of quantum
computers. This challenge has given rise to the field of post-quantum cryptography, which
focuses on designing and standardizing encryption schemes that are resistant to quantum
attacks [4], [10], [12], [13].
In summary, the fundamental differences between classical and quantum computing,
particularly in terms of their computational capabilities, have profound implications for the
security of current encryption methods. Quantum computers, with their ability to exploit
quantum phenomena, pose a significant threat to the mathematical foundations underlying
classical cryptographic schemes. This realization has sparked a global effort to develop and
standardize post-quantum cryptographic solutions that can safeguard digital communication
and data in the quantum era.
Quantum Computing Principles
The principles underlying quantum computing stand in stark contrast to the foundations of
classical computing, presenting both opportunities and challenges in the domain of
cryptography. Quantum computers leverage the unique properties of quantum mechanics,
including superposition and entanglement, to manipulate information in ways that are
fundamentally different from their classical counterparts [5], [6], [10].
At the heart of quantum computing are quantum bits, or qubits, which can exist in a
superposition of "0" and "1" states, unlike the binary states of classical bits [5], [6], [10]. This
quantum superposition allows qubits to represent and process multiple states simultaneously,
a phenomenon known as quantum parallelism. This parallelism is the key to the
computational power of quantum computers, as it enables them to perform certain tasks, such
as integer factorization and discrete logarithm computation, exponentially faster than classical
computers [1], [4], [7].
One of the most notable examples of this quantum advantage is Shor's algorithm, a quantum
algorithm developed in the 1990s that can efficiently factor large integers and compute
discrete logarithms [1], [7], [8]. This powerful algorithm, when executed on a large-scale
quantum computer, poses a grave threat to the security of RSA and ECC cryptographic
schemes, which rely on the intractability of these mathematical problems [1], [3], [4].
In addition to Shor's algorithm, Grover's algorithm, another prominent quantum algorithm,
can be used to perform a quadratic speedup in searching for preimages of hash functions,
potentially compromising the security of symmetric-key cryptography [4], [9]. This
vulnerability highlights the need for a comprehensive reevaluation of the security assumptions
underlying current cryptographic methods in the face of quantum computing [4], [10], [11].
Another key principle of quantum computing is the concept of quantum entanglement, where
the state of one qubit is inextricably linked to the state of another qubit, even when they are
physically separated [5], [6], [10]. This phenomenon allows for the instantaneous transmission
of information, a property that has significant implications for secure communication and key
distribution [5], [14], [15].
The unique properties of quantum systems, such as the no-cloning theorem and the
uncertainty principle, also play a crucial role in the development of quantum cryptographic
techniques like Quantum Key Distribution (QKD) [5], [16]. These principles enable the
creation of communication channels that are resistant to eavesdropping and manipulation,
offering an additional layer of security beyond traditional cryptographic techniques [5], [14],
[15].
As the field of quantum computing continues to advance, the principles underlying this
revolutionary technology pose both opportunities and challenges for the future of
cryptography. While the computational power of quantum computers threatens the security of
current encryption methods, the same quantum phenomena that enable their speed can also be
harnessed to develop novel cryptographic solutions capable of withstanding quantum attacks
[4], [10], [12], [13].
The understanding of quantum computing principles is essential for navigating the transition
to a post-quantum cryptographic landscape, where new encryption algorithms and key
distribution methods must be designed to safeguard digital communication and data in the
face of the impending quantum threat. This transition will require a multifaceted approach,
combining advancements in quantum research, cryptographic algorithm design, and secure
implementation strategies.
Impact on Encryption
The advent of quantum computing poses a severe threat to the security foundations of current
encryption methods, rendering many of them vulnerable to quantum attacks. Traditional
cryptographic schemes, such as RSA and Elliptic Curve Cryptography (ECC), have long been
the cornerstones of secure digital communication and data protection. However, the
computational power of quantum computers now jeopardizes the mathematical assumptions
underlying these classical encryption algorithms [1], [2], [3].
At the heart of the threat posed by quantum computing is Shor's algorithm, a quantum
algorithm that can efficiently factor large integers and compute discrete logarithms [1], [7],
[8]. These mathematical problems form the basis of the security guarantees provided by RSA
and ECC, respectively. Shor's algorithm, when executed on a large-scale quantum computer,
can break these cryptographic schemes exponentially faster than any classical computer [1],
[3], [4].
The implications of Shor's algorithm are far-reaching, as RSA and ECC are widely used to
secure a vast array of digital transactions and communications, including email, financial
transactions, and secure web browsing [1], [3], [4]. The ability of quantum computers to solve
these problems in a practical timeframe would render these encryption methods obsolete,
leaving sensitive data vulnerable to decryption by a quantum adversary [1], [4], [7].
In addition to the threat posed by Shor's algorithm, quantum computing also challenges the
security of symmetric-key cryptography. Grover's algorithm, another prominent quantum
algorithm, can be used to perform a quadratic speedup in searching for preimages of hash
functions, potentially compromising the security of symmetric-key encryption schemes [4],
[9]. This vulnerability highlights the need for a comprehensive reevaluation of the security
assumptions underlying current cryptographic methods in the face of quantum computing [4],
[10], [11].
The risk posed by quantum computing extends beyond just the factorization of large integers
and the computation of discrete logarithms. Quantum computers could also potentially be
used to break other cryptographic primitives, such as elliptic curve pairings and lattice-based
cryptography, which are increasingly being adopted as alternatives to RSA and ECC [4], [12],
[13]. This underscores the urgent need for the development of encryption schemes that are
resilient to quantum attacks.
The impending threat of quantum computing has prompted a global effort to develop and
standardize post-quantum cryptographic (PQC) solutions capable of withstanding quantum
attacks. These PQC schemes, such as lattice-based, code-based, and multivariate-based
cryptography, aim to provide a secure alternative to classical encryption methods in the
quantum era [4], [10], [12], [13]. However, the transition to these new cryptographic
algorithms is not without its challenges, as they require significant changes to existing
infrastructure and the development of new hardware and software solutions [17], [18].
In addition to the development of PQC algorithms, the field of quantum key distribution
(QKD) has emerged as a promising approach to secure communication in the quantum era [5],
[14], [15]. QKD leverages the principles of quantum mechanics to establish secure
communication channels that are resistant to eavesdropping and manipulation, providing an
additional layer of security beyond traditional cryptographic techniques [5], [16].
As the quantum computing landscape continues to evolve, the security community must
remain vigilant in addressing the vulnerabilities of current encryption methods and
proactively developing quantum-resistant solutions. The transition to a post-quantum
cryptographic landscape will require a multifaceted approach, combining advancements in
quantum research, algorithm design, and secure implementation strategies to ensure the
long-term security of digital communication and data [17], [18], [19].
The impact of quantum computing on encryption is a pressing concern that demands the
attention of both researchers and policymakers. The development of quantum-resistant
cryptographic solutions is not only a technical challenge but also a strategic imperative to
safeguard the integrity of our digital infrastructure in the face of the impending quantum
threat.
Encryption Algorithms Vulnerable to Quantum Computing
The emergence of quantum computing presents a grave threat to the security foundations of
widely-used encryption algorithms, rendering many of them vulnerable to quantum attacks.
At the heart of this threat lies Shor's algorithm, a quantum algorithm developed in the 1990s
that can efficiently factor large integers and compute discrete logarithms [1], [7], [8]. These
mathematical problems form the basis of the security guarantees provided by two of the most
widely-deployed public-key encryption schemes: RSA and Elliptic Curve Cryptography
(ECC) [1], [2], [3].
RSA encryption, which relies on the computational complexity of the integer factorization
problem, has long been a cornerstone of secure digital communication and data protection [1],
[3], [4]. However, Shor's algorithm, when executed on a large-scale quantum computer, can
break RSA encryption exponentially faster than any classical computer [1], [3], [4]. This is
because Shor's algorithm can efficiently factor the large prime numbers that form the public
and private keys of the RSA scheme, rendering the encryption method obsolete [1], [7], [8].
Similarly, Elliptic Curve Cryptography (ECC), another widely-adopted public-key encryption
scheme, is also vulnerable to Shor's algorithm. ECC relies on the computational complexity of
the discrete logarithm problem, which can be solved efficiently by Shor's algorithm on a
quantum computer [1], [3], [4]. This renders ECC-based encryption methods, such as Elliptic
Curve Digital Signature Algorithm (ECDSA), susceptible to quantum attacks, jeopardizing
the security of a wide range of digital transactions and communications [1], [3], [4].
The implications of Shor's algorithm on RSA and ECC encryption are far-reaching, as these
algorithms are extensively used to secure a vast array of digital applications, including email,
financial transactions, secure web browsing, and data storage [1], [3], [4]. The ability of
quantum computers to solve these problems in a practical timeframe would leave sensitive
data vulnerable to decryption by a quantum adversary, posing a significant threat to the
security of our digital infrastructure [1], [4], [7].
In addition to the threat posed by Shor's algorithm, quantum computing also challenges the
security of symmetric-key cryptography. Grover's algorithm, another prominent quantum
algorithm, can be used to perform a quadratic speedup in searching for preimages of hash
functions, potentially compromising the security of symmetric-key encryption schemes [4],
[9]. This vulnerability highlights the need for a comprehensive reevaluation of the security
assumptions underlying current cryptographic methods in the face of quantum computing [4],
[10], [11].
The risk posed by quantum computing extends beyond just the factorization of large integers
and the computation of discrete logarithms. Quantum computers could also potentially be
used to break other cryptographic primitives, such as elliptic curve pairings and lattice-based
cryptography, which are increasingly being adopted as alternatives to RSA and ECC [4], [12],
[13]. This underscores the urgent need for the development of encryption schemes that are
resilient to quantum attacks.
The impending threat of quantum computing has prompted a global effort to develop and
standardize post-quantum cryptographic (PQC) solutions capable of withstanding quantum
attacks. These PQC schemes, such as lattice-based, code-based, and multivariate-based
cryptography, aim to provide a secure alternative to classical encryption methods in the
quantum era [4], [10], [12], [13]. However, the transition to these new cryptographic
algorithms is not without its challenges, as they require significant changes to existing
infrastructure and the development of new hardware and software solutions [17], [18].
As the quantum computing landscape continues to evolve, the security community must
remain vigilant in addressing the vulnerabilities of current encryption methods and
proactively developing quantum-resistant solutions. The transition to a post-quantum
cryptographic landscape will require a multifaceted approach, combining advancements in
quantum research, algorithm design, and secure implementation strategies to ensure the
long-term security of digital communication and data [17], [18], [19]. The impact of quantum
computing on encryption is a pressing concern that demands the attention of both researchers
and policymakers, as the development of quantum-resistant cryptographic solutions is a
strategic imperative to safeguard the integrity of our digital infrastructure.
Quantum Computing Attacks on Encryption
The emergence of quantum computing poses a grave threat to the security of widely-used
encryption algorithms, rendering many of them vulnerable to quantum attacks. At the heart of
this threat lies Shor's algorithm, a quantum algorithm developed in the 1990s that can
efficiently factor large integers and compute discrete logarithms [1], [7], [8]. These
mathematical problems form the basis of the security guarantees provided by two of the most
widely-deployed public-key encryption schemes: RSA and Elliptic Curve Cryptography
(ECC) [1], [2], [3].
RSA encryption, which relies on the computational complexity of the integer factorization
problem, has long been a cornerstone of secure digital communication and data protection [1],
[3], [4]. However, Shor's algorithm, when executed on a large-scale quantum computer, can
break RSA encryption exponentially faster than any classical computer [1], [3], [4]. This is
because Shor's algorithm can efficiently factor the large prime numbers that form the public
and private keys of the RSA scheme, rendering the encryption method obsolete [1], [7], [8].
Similarly, Elliptic Curve Cryptography (ECC), another widely-adopted public-key encryption
scheme, is also vulnerable to Shor's algorithm. ECC relies on the computational complexity of
the discrete logarithm problem, which can be solved efficiently by Shor's algorithm on a
quantum computer [1], [3], [4]. This renders ECC-based encryption methods, such as Elliptic
Curve Digital Signature Algorithm (ECDSA), susceptible to quantum attacks, jeopardizing
the security of a wide range of digital transactions and communications [1], [3], [4].
The implications of Shor's algorithm on RSA and ECC encryption are far-reaching, as these
algorithms are extensively used to secure a vast array of digital applications, including email,
financial transactions, secure web browsing, and data storage [1], [3], [4]. The ability of
quantum computers to solve these problems in a practical timeframe would leave sensitive
data vulnerable to decryption by a quantum adversary, posing a significant threat to the
security of our digital infrastructure [1], [4], [7].
In addition to the threat posed by Shor's algorithm, quantum computing also challenges the
security of symmetric-key cryptography. Grover's algorithm, another prominent quantum
algorithm, can be used to perform a quadratic speedup in searching for preimages of hash
functions, potentially compromising the security of symmetric-key encryption schemes [4],
[9]. This vulnerability highlights the need for a comprehensive reevaluation of the security
assumptions underlying current cryptographic methods in the face of quantum computing [4],
[10], [11].
The risk posed by quantum computing extends beyond just the factorization of large integers
and the computation of discrete logarithms. Quantum computers could also potentially be
used to break other cryptographic primitives, such as elliptic curve pairings and lattice-based
cryptography, which are increasingly being adopted as alternatives to RSA and ECC [4], [12],
[13]. This underscores the urgent need for the development of encryption schemes that are
resilient to quantum attacks.
The impending threat of quantum computing has prompted a global effort to develop and
standardize post-quantum cryptographic (PQC) solutions capable of withstanding quantum
attacks. These PQC schemes, such as lattice-based, code-based, and multivariate-based
cryptography, aim to provide a secure alternative to classical encryption methods in the
quantum era [4], [10], [12], [13]. However, the transition to these new cryptographic
algorithms is not without its challenges, as they require significant changes to existing
infrastructure and the development of new hardware and software solutions [17], [18].
As the quantum computing landscape continues to evolve, the security community must
remain vigilant in addressing the vulnerabilities of current encryption methods and
proactively developing quantum-resistant solutions. The transition to a post-quantum
cryptographic landscape will require a multifaceted approach, combining advancements in
quantum research, algorithm design, and secure implementation strategies to ensure the
long-term security of digital communication and data [17], [18], [19]. The impact of quantum
computing on encryption is a pressing concern that demands the attention of both researchers
and policymakers, as the development of quantum-resistant cryptographic solutions is a
strategic imperative to safeguard the integrity of our digital infrastructure.
Mitigation Strategies
As the threat of quantum computing to existing encryption methods becomes increasingly
apparent, the global research community has responded with a concerted effort to develop and
standardize post-quantum cryptographic (PQC) solutions capable of withstanding quantum
attacks. These PQC schemes aim to provide a secure alternative to classical encryption
algorithms, such as RSA and Elliptic Curve Cryptography (ECC), which are vulnerable to
Shor's algorithm and other quantum-based attacks [4], [10], [12], [13].
The development of PQC algorithms has emerged as a critical strategy to mitigate the impact
of quantum computing on cybersecurity. These quantum-resistant cryptographic schemes
leverage a diverse array of mathematical foundations, including lattice-based, code-based,
hash-based, and multivariate-based approaches, to ensure security in the face of quantum
threats [4], [10], [12], [13].
Lattice-based cryptography, for instance, relies on the hardness of problems related to finding
short vectors in lattices, which are believed to be resistant to both classical and quantum
attacks [4], [12], [20]. Schemes such as Kyber and Crystals-DILITHIUM, which are based on
the ring learning with errors (RLWE) and module learning with errors (MLWE) problems,
have emerged as leading candidates in the ongoing NIST standardization process for
post-quantum cryptography [4], [18], [21].
Code-based cryptography, on the other hand, leverages the complexity of decoding random
linear codes, a problem that is believed to be difficult for both classical and quantum
computers [4], [12], [13]. The McEliece and Niederreiter cryptosystems are examples of
code-based schemes that have garnered attention in the PQC landscape [4], [12].
In addition to lattice-based and code-based approaches, the field of post-quantum
cryptography encompasses hash-based and multivariate-based schemes, each offering unique
advantages and considerations in the transition to a quantum-resistant future [4], [12], [13].
Alongside the development of PQC algorithms, the research community has also explored the
potential of quantum key distribution (QKD) as a complementary strategy to secure
communication in the quantum era [5], [14], [15]. QKD leverages the principles of quantum
mechanics, such as the no-cloning theorem and the uncertainty principle, to establish secure
communication channels that are resistant to eavesdropping and manipulation [5], [16]. By
relying on the inherent properties of quantum systems, QKD offers an additional layer of
security beyond traditional cryptographic techniques, safeguarding the distribution of
encryption keys in a quantum-resistant manner [5], [14], [15].
The transition to a post-quantum cryptographic landscape, however, is not without its
challenges. The deployment of PQC algorithms and QKD systems requires significant
changes to existing infrastructure, including the development of new hardware and software
solutions, key management protocols, and secure implementation strategies [17], [18], [19].
Ensuring a smooth and seamless transition is crucial to maintain the security and integrity of
digital communication and data in the face of the quantum threat.
To address these challenges, researchers and policymakers have emphasized the importance of
a comprehensive and collaborative approach. This includes fostering international
cooperation, investment in research and development, the establishment of standards and
guidelines, and the development of migration strategies to gradually transition critical systems
and applications to quantum-resistant solutions [22], [23], [19].
Furthermore, the ethical implications of quantum computing and its impact on privacy and
security have also emerged as important considerations in the development of mitigation
strategies. Ensuring the protection of individual rights and the preservation of digital trust in
the quantum era will require the integration of privacy-enhancing technologies and the
consideration of human rights principles in the governance and regulation of quantum
computing [24].
As the quantum computing landscape continues to evolve, the development and
standardization of post-quantum cryptographic solutions, coupled with the strategic
deployment of quantum key distribution systems, represent critical steps in safeguarding the
security of our digital infrastructure. This multifaceted approach, supported by collaborative
efforts and proactive policymaking, will be essential in navigating the transition to a
quantum-resilient future and maintaining the trust and integrity of our digital systems.
Conclusion
The advent of quantum computing poses a profound and multifaceted threat to the security of
our digital infrastructure, with the potential to break many of the encryption algorithms that
underpin the confidentiality and integrity of our communications and data. At the heart of this
threat lies the power of quantum algorithms, particularly Shor's algorithm, which can
efficiently factor large integers and compute discrete logarithms [1], [7], [8]. These
mathematical problems form the foundation of the security guarantees provided by
widely-used public-key encryption schemes, such as RSA and Elliptic Curve Cryptography
(ECC) [1], [2], [3].
The ability of quantum computers to solve these problems exponentially faster than classical
computers renders these encryption methods vulnerable to quantum attacks [1], [3], [4]. The
implications are far-reaching, as RSA and ECC are extensively used to secure a vast array of
digital applications, including email, financial transactions, secure web browsing, and data
storage [1], [3], [4]. The potential for sensitive data to be decrypted by a quantum adversary
poses a significant threat to the security and integrity of our digital infrastructure.
In addition to the threat posed by Shor's algorithm, quantum computing also challenges the
security of symmetric-key cryptography. Grover's algorithm, another prominent quantum
algorithm, can be used to perform a quadratic speedup in searching for preimages of hash
functions, potentially compromising the security of symmetric-key encryption schemes [4],
[9]. This vulnerability highlights the need for a comprehensive reevaluation of the security
assumptions underlying current cryptographic methods in the face of quantum computing [4],
[10], [11].
The research community and industry leaders have responded to this urgent challenge with a
concerted effort to develop and standardize post-quantum cryptographic (PQC) solutions
capable of withstanding quantum attacks. These PQC schemes, such as lattice-based,
code-based, hash-based, and multivariate-based cryptography, aim to provide a secure
alternative to classical encryption algorithms in the quantum era [4], [10], [12], [13].
While the development of PQC algorithms represents a critical strategy, the transition to a
quantum-resistant cryptographic landscape is not without its challenges. Deploying these new
encryption schemes requires significant changes to existing infrastructure, including the
development of new hardware and software solutions, key management protocols, and secure
implementation strategies [17], [18], [19]. Ensuring a smooth and seamless transition is
crucial to maintain the security and integrity of digital communication and data in the face of
the quantum threat.
Alongside the development of PQC algorithms, the research community has also explored the
potential of quantum key distribution (QKD) as a complementary strategy to secure
communication in the quantum era [5], [14], [15]. QKD leverages the principles of quantum
mechanics to establish secure communication channels that are resistant to eavesdropping and
manipulation, providing an additional layer of security beyond traditional cryptographic
techniques [5], [16].
To address the challenges posed by quantum computing, a comprehensive and collaborative
approach is essential. This includes fostering international cooperation, investment in research
and development, the establishment of standards and guidelines, and the development of
migration strategies to gradually transition critical systems and applications to
quantum-resistant solutions [22], [23], [19]. Additionally, the ethical implications of quantum
computing and its impact on privacy and security must be carefully considered and integrated
into the development of mitigation strategies [24].
In conclusion, the threat posed by quantum computing to the security of encryption
algorithms is a pressing concern that demands the attention of researchers, industry leaders,
and policymakers alike. The development and standardization of post-quantum cryptographic
solutions, coupled with the strategic deployment of quantum key distribution systems,
represent critical steps in safeguarding the security of our digital infrastructure. By adopting a
multifaceted and proactive approach, the global community can navigate the transition to a
quantum-resilient future and maintain the trust and integrity of our digital systems in the face
of this transformative technological revolution.
References
[1] Abhishek Shukla "Future of Current Encryption Algorithm in Quantum Computing Age
and their Future." International Journal of Science and Research (IJSR) (2023). DOI:
10.21275/sr231116135144.
[2] Rama Azhari, Agita Nisa Salsabila "Analyzing the Impact of Quantum Computing on
Current Encryption Techniques." IAIC Transactions on Sustainable Digital Innovation
(ITSDI) (2024). DOI: 10.34306/itsdi.v5i2.662.
[3] A. Jenefa, F. T. Josh, Antony Taurshia, K. R. Kumar, S. Kowsega, Edward Naveen "PQC
Secure: Strategies for Defending Against Quantum Threats." None (2023). DOI:
10.1109/ICACRS58579.2023.10404525.
[4] Domi Caroline, R. Arthi "Quantum Key Distribution Algorithm for Network Security."
None (2021). DOI: 10.17762/TURCOMAT.V12I9.3702.
[5] S. Ambika, V. Balaji, R. Rajasekaran, P. N. Periyasamy, N. Kamal "Explore the Impact of
Quantum Computing to Enhance Cryptographic Protocols and Network Security Measures."
None (2024). DOI: 10.1109/IC2PCT60090.2024.10486607.
[6] Norberto Novoa Torres, Juan Carlos, Erik Alexis "Systems Security Affectation with the
Implementation of Quantum Computing." None (n.d.). DOI:
10.14569/IJACSA.2021.0120405.
[7] G. Alagic, S. Jeffery, M. Ozols, Alexander Poremba "On non-adaptive quantum
chosen-ciphertext attacks and Learning with Errors." arXiv.org (2018). DOI: None.
[8] I. Stewart, D. Ilie, Alexei Zamyatin, Sam M. Werner, M. F. Torshizi, W. Knottenbelt
"Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum
computing attack." Royal Society Open Science (2018). DOI: 10.1098/rsos.180410.
[9] A. Abuarqoub, Simak Abuarqoub, A. Alzubi, A. Muthanna "The Impact of Quantum
Computing on Security in Emerging Technologies." International Conference on Future
Networks and Distributed Systems (2021). DOI: 10.1145/3508072.3508099.
[10] A. Bhat, Aditya Iyer "Applications of quantum computing in IT security." None (n.d.).
DOI: None.
[11] Silong Li, Yuxiang Chen, Lin Chen, Jing Liao, Chanchan Kuang, KuanChing Li, Wei
Liang, Naixue Xiong "Post-Quantum Security: Opportunities and Challenges."
Multidisciplinary Digital Publishing Institute (2023). DOI:
https://doi.org/10.3390/s23218744.
[12] M. Barbeau, E. Kranakis, Nicolas Perez "Authenticity, Integrity, and Replay Protection
in Quantum Data Communications and Networking." ACM Transactions on Quantum
Computing (2022). DOI: 10.1145/3517341.
[13] Ravikar Srivastava "A New Approach towards Quantum Resistant Cryptography."
International journal of advanced networking and applications (n.d.). DOI:
10.35444/ijana.2022.iccmeapaper11.
[14] Zhixin Liu, Qiaoling Xie, Yongfu Zha, Yumin Dong "Quantum public key encryption
scheme with four states key." Physica Scripta (2022). DOI: 10.1088/1402-4896/ac576c.
[15] B.V.N. Prasad Paruchuri, Madhu Latha Veerapaneni, G. Rames, Vinay Kumar Awaar,
Abhilasha Chauhan "Beyond Binary: The Capabilities of Classical and Quantum Computing
for Securing Data Transmission." E3S Web of Conferences (n.d.). DOI:
10.1051/e3sconf/202343001073.
[16] Chuan Xu, Ferhat Erata, Jakub Szefer "Exploration of Power Side-Channel
Vulnerabilities in Quantum Computer Controllers." Conference on Computer and
Communications Security (2023). DOI: 10.1145/3576915.3623118.
[17] Lei Zhang, Andriy Miranskyy, Walid Rjaibi, Greg Stager, Michael A. Gray, J.S. Peck
"Making existing software quantum safe: A case study on IBM Db2." Elsevier BV (2023).
DOI: https://doi.org/10.1016/j.infsof.2023.107249.
[18] Islombek Abdikhakimov "Preparing for a Quantum Future: Strategies for Strengthening
International Data Privacy in the Face of Evolving Technologies." International journal of law
and policy (2024). DOI: 10.59022/ijlp.189.
[19] Moolchand Sharma, Vikas Choudhary, R. Bhatia, Sahil Malik, Anshuman Raina, Harshit
Khandelwal "Leveraging the power of quantum computing for breaking RSA encryption."
Cyber-Physical Systems (2020). DOI: 10.1080/23335777.2020.1811384.
[20] Sanjaikanth E Vadakkethil Somanathan Pillai, Kiran Polimetla "Analyzing the Impact of
Quantum Cryptography on Network Security." None (2024). DOI:
10.1109/ICICACS60521.2024.10498417.
[21] G. Alagic, S. Jeffery, M. Ozols, Alexander Poremba "On Quantum Chosen-Ciphertext
Attacks and Learning with Errors." IACR Cryptology ePrint Archive (2018). DOI:
10.3390/cryptography4010010.
[22] B. Kumar, Sheetal B. Prasad, Parashu Ram Pal, Pankaj Pathak "Quantum Security for
IoT to Secure Healthcare Applications and Their Data." None (n.d.). DOI:
10.4018/978-1-7998-6677-0.CH008.
[23] Yaser Baseri, Vikas Chouhan, Ali Ghorbani, Aaron Chow "Evaluation Framework for
Quantum Security Risk Assessment: A Comprehensive Study for Quantum-Safe Migration."
arXiv.org (2024). DOI: 10.2139/ssrn.4750609.
[24] Bikram Paul "A Novel Low-Power Encryption Scheme Based on Chaotic Dynamic
Triple Pendulum System for Wide Range of Applications." None (2021). DOI:
10.36227/TECHRXIV.14778129.V1.
Source Source Information Insight Related
to Question Relevant Extracts
1 Future of Current Encryption Algorithm in
Quantum Computing Age and their Future
PDF: Not Available
Author: Abhishek Shukla
Citation Count: 0
Journal: International Journal of Science
and Research (IJSR)
Publication Date: 2023-10-05
DOI: 10.21275/sr231116135144
Quantum
computing can
break encryption
by solving
complex
mathematical
problems
exponentially
faster than
classical
computers, posing
a threat to
widely-used
encryption
schemes like RSA
and AES.
Post-quantum
cryptography and
quantum-safe
encryption are
being developed
to withstand
quantum attacks.
Organizations and
governments
must take
proactive
measures to
transition to
quantum-resistant
encryption.
[1] Extracted Source
: The advent of quantum computing
poses a formidable challenge to the
security landscape, particularly in the
realm of encryption. Current
encryption algorithms, which have
safeguarded sensitive data for
decades, face unprecedented threats
from quantum computers capable of
solving complex mathematical
problems exponentially faster than
classical computers. This essay
explores the challenges that quantum
computing presents to existing
encryption methods, focusing on the
vulnerabilities of widely-used schemes
like RSA and AES. In response to this
quantum threat, the concept of
post-quantum cryptography is
introduced, encompassing innovative
encryption techniques resilient to
quantum attacks. Additionally, the
notion of quantum-safe encryption is
examined, highlighting efforts to
develop encryption methods that can
withstand quantum adversaries. The
essay also underscores the gradual
nature of the transition to
quantum-resistant encryption and
emphasizes the importance of
proactive measures for organizations
and governments. As we stand on the
cusp of the quantum computing age,
the future of current encryption
algorithms remains uncertain, but it
also promises a new era of
cryptographic innovation and
resilience.
2 Analyzing the Impact of Quantum
Computing on Current Encryption
Techniques
PDF: Available
Author: Rama Azhari, Agita Nisa Salsabila
Citation Count: 0
Journal: IAIC Transactions on Sustainable
Digital Innovation (ITSDI)
Publication Date: 2024-02-22
DOI: 10.34306/itsdi.v5i2.662
Quantum
computing can
break encryption
by compromising
traditional
encryption
methods and
exposing
vulnerabilities in
widely-used
cryptographic
protocols such as
RSA and AES.
[1] Extracted Source
As the field of quantum computing
progresses, the disruption to
traditional encryption methods, which
secure vast amounts of sensitive data,
becomes an imminent threat, and
conventional encryption techniques,
primarily based on mathematical
complexity, may no longer suffice in
the era of quantum supremacy. This
research systematically analyzes the
vulnerabilities of current encryption
standards in the face of advanced
quantum computing capabilities,
focusing specifically on widely-used
cryptographic protocols such as RSA
and AES, which are foundational to
Source Source Information Insight Related
to Question Relevant Extracts
modern cybersecurity. Employing the
SmartPLS method, the study models
the interaction between quantum
computing power and the robustness
of existing encryption techniques,
involving simulating quantum attacks
on sample cryptographic algorithms to
evaluate their quantum resistance.
The findings reveal that quantum
computing possesses the capacity to
significantly compromise traditional
encryption methods within the next
few decades, with RSA encryption
showing substantial vulnerabilities
while AES requires considerably larger
key sizes to maintain security. This
study underscores the urgency for the
development of quantum-resistant
encryption techniques, critical to
safeguarding future digital
communication and data integrity, and
advocates for a paradigm shift in
cryptographic research and practice,
emphasizing the need for
''quantum-proof'' algorithms. It also
contributes to the strategic planning
for cybersecurity in the quantum age
and provides a methodological
framework using SmartPLS for further
exploration into the impact of
emerging technologies on existing
security protocols.
3 PQC Secure: Strategies for Defending
Against Quantum Threats
PDF: Not Available
Author: A. Jenefa, F. T. Josh, Antony
Taurshia, K. R. Kumar, S. Kowsega,
Edward Naveen
Citation Count: 1
Journal: None
Publication Date: 2023-12-11
DOI:
10.1109/ICACRS58579.2023.10404525
Quantum
computing can
break encryption
by swiftly
decrypting
algorithms like
Shors and
Grovers, exposing
traditional
cryptographic
infrastructures to
vulnerabilities.
[1] Extracted Source
As quantum computing emerges, the
security domain is set to encounter
unparalleled challenges, necessitating
a pivotal shift to Post-Quantum
Cryptography (PQC) for safeguarding
against quantum adversities. Current
cryptographic mechanisms, especially
RSA and ECC, are susceptible to
quantum breaches due to their
reliance on factorization and discrete
logarithm problems. The emergence of
quantum computers endangers
traditional cryptographic
infrastructures, exposing them to swift
decryption by algorithms like Shors,
$N=p \cdot q$, and Grovers, $r \equiv
a^{\frac{N}{2}} \bmod N$, where N is
the product of two significant primes, p
and q, and r denotes the remainder
after applying Grovers algorithm to a.
Conventional cryptographic methods,
which rest on problems solvable by
quantum computers, emphasize the
need to transition to PQC, substituting
prevalent methods with
quantum-resilient alternatives,
represented by $E=m^{e} \bmod n$,
where E is the encrypted message, m
Source Source Information Insight Related
to Question Relevant Extracts
the plaintext, e the public key
exponent, and n the product of two
prime numbers. This research
evaluates the efficacy of PQC
approaches, encompassing
lattice-based, code-based, and
isogeny-based cryptography, with
assessments based on metrics like
encryption duration,
$T_{e}=\frac{1}{f_{e}}$, and key
length, $\log _{2}(N)$, where $T_{e}$
represents encryption time and $f_{e}$
the encryption speed. Employing
standardized datasets, we examine
encryption and decryption speeds, key
sizes, and success metrics against
NISTs endorsed security standards.
The findings underscore PQCs
potential in delivering robust security,
albeit with variations in performance
metrics, guiding secure
communication choices. In
summation, the study highlights the
essential shift to PQC in addressing
the vulnerabilities ushered in by
quantum computing, presenting a
spectrum of fortified strategies for the
future of information security.
4 Quantum Key Distribution Algorithm for
Network Security
PDF: Not Available
Author: Domi Caroline, R. Arthi
Citation Count: 1
Journal: None
Publication Date: 2021-04-24
DOI: 10.17762/TURCOMAT.V12I9.3702
Quantum
computing can
break encryption
by using
algorithms like
Shor's and
Grover's to
decrypt
information in a
more secure
manner than
classical methods.
[1] Extracted Source
Quantum computing computes using
superposition principles and
entanglement principles that are the
part of quantum. Quantum computers
are used to solve certain problems
that cannot be solved using classical
computers. The most widely using
quantum models are quantum circuit
uses qubits or quantum bits.In
cryptography, Quantum cryptography
provides more security than classical
methods. Shors algorithm and Grovers
algorithm are mainly used methods for
quantum cryptography. The encryption
and decryption is done using
Rectilinear bases or Diagonal bases in
random manner.The Quantum key
distribution QKD is a symmetric
encryption key distribution method.
The important feature of QKD is
authentication and confidentiality.
Public key protocol and a symmetric
secret key is used to provide quantum
safe key exchange and guarantee for
long term communication in the
network. In the proposed system, the
Morse code is used for encryption and
decryption. The Morse code used to
encrypt bits as light photons that are
required for quantum key distribution.
5 Explore the Impact of Quantum Computing Quantum [1] Extracted Source
Source Source Information Insight Related
to Question Relevant Extracts
to Enhance Cryptographic Protocols and
Network Security Measures
PDF: Not Available
Author: S. Ambika, V. Balaji, R.
Rajasekaran, P. N. Periyasamy, N. Kamal
Citation Count: 0
Journal: None
Publication Date: 2024-02-09
DOI:
10.1109/IC2PCT60090.2024.10486607
computing can
break encryption
by exploiting
vulnerabilities in
conventional
cryptographic
algorithms like
RSA and ECC.
The revolutionary effects of quantum
computing on security procedures for
networks and cryptographic protocols
are the focus of this study. Our
research shows that conventional
cryptographic algorithms are
susceptible to quantum assaults;
specifically, RSA and ECC encryption
are very vulnerable. On the other
hand, cryptographic algorithms that
are immune to quantum attacks, such
as multivariate polynomial
cryptography and lattice-based
algorithms, show promise in meeting
these challenges. Key exchange rates
between 200 kbps and 450 kbps and
error rates as low as 0.5% are some of
the significant achievements shown by
Quantum Key Distribution (QKD)
implementations. These applications
show that QKD is a viable solution for
protecting communication channels up
to 200 km away. On top of that, there
are remarkable outcomes when
network security systems incorporate
quantum advancements. The
detection accuracy of
Quantum-Enhanced Intrusion
Detection Systems (QIDS) is 98.5%
and the false positive rate is minimally
0.2%. The detection accuracy of
quantum-secured communication
systems is 99.2% and the false
positive rate is an extremely low 0.1%.
While quantum firewalls keep a
detection accuracy of 97.8% and a
false positive rate of 0.3%,
quantum-safe cryptographic modules
show a low latency of 3 ms.
6 Systems Security Affectation with the
Implementation of Quantum Computing
PDF: Not Available
Author: Norberto Novoa Torres, Juan
Carlos, Erik Alexis
Citation Count: 0
Journal: None
Publication Date: None
DOI: 10.14569/IJACSA.2021.0120405
Quantum
computing can
break encryption
by allowing for
faster and simpler
decryption of
information,
putting worldwide
organizations at
risk.
[1] Extracted Source
Current security systems use
cryptographic robust tools that have
been of great help in regulating
information. During its time the
implementation of these tools
abolished the classic security
systems, as by means of cryptanalysis
they allowed decryption of information
in a fast, automated, and simple mode
from these systems. Considering this
scenario, the same happens when
quantum cryptographic systems are
implemented, insomuch as the current
security systems could be abolished,
as tools exist that permit its encryption
in a simple way, but with the risk of
putting the data of worldwide
organizations in danger. With the
purpose of mitigating these risks, it is
necessary to consider the upgrade of
the available security systems, by
Source Source Information Insight Related
to Question Relevant Extracts
security systems and quantic
encryption, before a massive
implementation of the quantum
computers use as an everyday tool.
With this it does not mean that
quantum computing would be a
disadvantage, on the contrary, the
advantages from this technology will
mean that security information and
data are almost invulnerable, which is
a meaningful advance in the IT field.
With security information professionals
are obliged to recommend and
perform an appropriate migration of
new technologies to avoid existing
exposition risks as data as well as
transactions. If this were not the case,
the same scenario presented in the
classic security systems would occur.
KeywordsQuantum computing;
encryption; cryptography;
cryptanalysis; data security
7 On non-adaptive quantum
chosen-ciphertext attacks and Learning
with Errors
PDF: Not Available
Author: G. Alagic, S. Jeffery, M. Ozols,
Alexander Poremba
Citation Count: 2
Journal: arXiv.org
Publication Date: 2018-12-03
DOI: None
Quantum
computing can
break encryption
by allowing
adversaries to
recover secret
keys with constant
success
probability using
quantum
decryption
queries.
[1] Extracted Source
Large-scale quantum computing is a
signicant threat to classical public-key
cryptography. In strong quantum
access security models, numerous
symmetric-key cryptosystems are also
vulnerable. We consider classical
encryption in a model which grants the
adversary quantum oracle access to
encryption and decryption, but where
the latter is restricted to non-adaptive
(i.e., pre-challenge) queries only. We
dene this model formally using
appropriate notions of ciphertext
indistinguishability and semantic
security (which are equivalent by
standard arguments) and call it
QCCA1 in analogy to the classical
CCA1 security model. Using a bound
on quantum random-access codes, we
show that the standard PRF- and
PRP-based encryption schemes are
QCCA1-secure when instantiated with
quantum-secure primitives.We then
revisit standard IND-CPA-secure
Learning with Errors (LWE) encryption
and show that leaking just one
quantum decryption query (and no
other queries or leakage of any kind)
allows the adversary to recover the full
secret key with constant success
probability. In the classical setting, by
contrast, recovering the key uses a
linear number of decryption queries,
and this is optimal. The algorithm at
the core of our attack is a
(large-modulus version of) the
well-known Bernstein-Vazirani
algorithm. We emphasize that our
Source Source Information Insight Related
to Question Relevant Extracts
results should not be interpreted as a
weakness of these cryptosystems in
their stated security setting (i.e.,
postquantum chosen-plaintext
secrecy). Rather, our results mean
that, if these cryptosystems are
exposed to chosen-ciphertext attacks
(e.g., as a result of deployment in an
inappropriate realworld setting) then
quantum attacks are even more
devastating than classical ones.
8 Committing to quantum resistance: a slow
defence for Bitcoin against a fast quantum
computing attack
PDF: Not Available
Author: I. Stewart, D. Ilie, Alexei Zamyatin,
Sam M. Werner, M. F. Torshizi, W.
Knottenbelt
Citation Count: 38
Journal: Royal Society Open Science
Publication Date: 2018-06-01
DOI: 10.1098/rsos.180410
Quantum
computing can
break encryption
by efficiently
solving
mathematical
problems like
integer
factorization and
discrete
logarithms used in
public key
cryptography.
[1] Extracted Source
Quantum computers are expected to
have a dramatic impact on numerous
fields due to their anticipated ability to
solve classes of mathematical
problems much more efficiently than
their classical counterparts. This
particularly applies to domains
involving integer factorization and
discrete logarithms, such as public key
cryptography. In this paper, we
consider the threats a
quantum-capable adversary could
impose on Bitcoin, which currently
uses the Elliptic Curve Digital
Signature Algorithm (ECDSA) to sign
transactions. We then propose a
simple but slow commitdelayreveal
protocol, which allows users to
securely move their funds from old
(non-quantum-resistant) outputs to
those adhering to a quantum-resistant
digital signature scheme. The
transition protocol functions even if
ECDSA has already been
compromised. While our scheme
requires modifications to the Bitcoin
protocol, these can be implemented as
a soft fork.
9 The Impact of Quantum Computing on
Security in Emerging Technologies
PDF: Not Available
Author: A. Abuarqoub, Simak Abuarqoub,
A. Alzubi, A. Muthanna
Citation Count: 2
Journal: International Conference on Future
Networks and Distributed Systems
Publication Date: 2021-12-15
DOI: 10.1145/3508072.3508099
Quantum
computing can
break encryption
by solving the key
distribution
problem and
breaking
cryptographic
algorithms based
on asymmetric
cryptography.
[1] Extracted Source
Quantum computing is rapidly shifting
from high-tech lab to mainstream
commercial use in the next few years,
representing the next breakthrough in
modern ICT. It is motivated by
quantum computer''s ability to perform
computational tasks with efficiencies
that are not possible with classical
computers. Quantum computing
technology has a lasting potential
impact on society and broad
implications on many aspects of our
lives. Although quantum computing
has several advantages, it threatens
the security of current cryptographic
techniques. It is expected that
quantum computers will be able to
solve the key distribution problem and
break every single cryptography and
Source Source Information Insight Related
to Question Relevant Extracts
authentication algorithm based on
asymmetric cryptography. New
emerging technologies such as the
Internet of Things, blockchain,
autonomous vehicles, 5G, artificial
intelligence and robotics all rely on
cryptography for their secure
operation. Therefore, the realisation of
quantum computing will pose
significant challenges to the current
progress and future development of
these technologies. In this paper, the
quantum technology preliminaries are
discussed. The possible impact of
quantum technologies on emerging
technologies is investigated. Finally,
some of the currently available
quantum-safe cryptosystems devoted
to protecting computer systems in the
quantum era are discussed.
10 Applications of quantum computing in IT
security
PDF: Not Available
Author: A. Bhat, Aditya Iyer
Citation Count: 0
Journal: None
Publication Date: None
DOI: None
Quantum
computing can
break encryption
by rendering
current systems
like RSA
ineffective,
making quantum
cryptography with
quantum key
distribution the
future of secure
data protection.
[1] Extracted Source
Observing the developments in the
quantum computing, our current
encryption-decryption systems such
as the RSA are insubstantial.
Therefore, to maintain the security and
protection of data, quantum
cryptography through the
understanding of quantum key
distribution is the future of secured
user-data
11 Post-Quantum Security: Opportunities and
Challenges
PDF: Available
Author: Silong Li, Yuxiang Chen, Lin Chen,
Jing Liao, Chanchan Kuang, KuanChing Li,
Wei Liang, Naixue Xiong
Citation Count: 3
Journal: Multidisciplinary Digital Publishing
Institute
Publication Date: 2023-10-26
DOI: https://doi.org/10.3390/s23218744
Quantum
computing can
break encryption
by quickly solving
mathematical
challenges that
traditional
computers
cannot.
[1] Extracted Source
Cryptography is very essential in our
daily life, not only for confidentiality of
information, but also information
integrity verification, non-repudiation,
authentication, and other aspects. In
modern society, cryptography widely
used; everything from personal life to
national security inseparable it. With
the emergence quantum computing,
traditional encryption methods are at
risk being cracked. People beginning
explore defending against computer
attacks. Among currently developed,
key distribution a technology that uses
principles mechanics distribute keys.
Post-quantum algorithms rely on
mathematical challenges computers
cannot solve quickly ensure security.
this study, an integrated review
post-quantum conducted perspective
cryptography. First, concept
development background introduced.
Then, algorithm Kyber studied. Finally,
achievements, difficulties outstanding
problems emerging field summarized,
Source Source Information Insight Related
to Question Relevant Extracts
some predictions future made.
12 Authenticity, Integrity, and Replay
Protection in Quantum Data
Communications and Networking
PDF: Not Available
Author: M. Barbeau, E. Kranakis, Nicolas
Perez
Citation Count: 3
Journal: ACM Transactions on Quantum
Computing
Publication Date: 2022-03-25
DOI: 10.1145/3517341
Quantum data
communications
can be protected
using quantum
cryptography and
classical key
management
techniques.
[1] Extracted Source
Quantum data communications and
networking involve classical hardware
and software. Quantum storage is
sensitive to environmental
disturbances that may have malicious
origins. Teleportation and
entanglement swapping, two building
blocks for the future quantum Internet,
rely on secure classical bit
communications. When lack of
authenticity, integrity, and replay
protection may have a high impact,
quantum data communications are at
risk and need to be protected. Building
upon quantum cryptography and
random generation of quantum
operators, we propose a solution to
protect the authenticity, integrity, and
replay of quantum data
communications. Our solution includes
a classical data interface to quantum
data cryptography. We describe how
classical keying material can be
mapped to quantum operators. This
enables classical key management
techniques for secure quantum data
communications.
13 A New Approach towards Quantum
Resistant Cryptography
PDF: Not Available
Author: Ravikar Srivastava
Citation Count: 0
Journal: International journal of advanced
networking and applications
Publication Date: None
DOI: 10.35444/ijana.2022.iccmeapaper11
Quantum
computing can
break encryption
by rendering most
cryptosystems
ineffective, but
cryptography
through lattice
and mersenne
primes offers a
potential solution.
[1] Extracted Source
Quantum computing is another
developing innovation which is going
to impact whole computing process
and especially cryptography. Most of
the cryptosystems will fail when
quantum computing becomes a reality.
In such situation cryptography through
lattice and mersenne primes is a ray of
hope. In this paper, we investigate the
impact of quantum computing on
cryptography and possible solution to
provide a secure system.
14 Quantum public key encryption scheme
with four states key
PDF: Not Available
Author: Zhixin Liu, Qiaoling Xie, Yongfu
Zha, Yumin Dong
Citation Count: 1
Journal: Physica Scripta
Publication Date: 2022-02-22
DOI: 10.1088/1402-4896/ac576c
Quantum
computing can
break encryption
by leveraging the
power of qubits in
public key
encryption
schemes.
[1] Extracted Source
Asymmetric encryption has some
important applications in the field of
communication. In classical
computers, most public key encryption
schemes are designed based on
computational assumption. In other
words, they can ensure computational
security. When the computing power is
large enough, it will pose a threat to
these encryption schemes. We
propose a quantum public key
encryption scheme which based on
properties of quantum physics. Our
scheme realizes encryption and
Source Source Information Insight Related
to Question Relevant Extracts
decryption with few resources and
does not rely on any computational
assumption. The key in our scheme
consists of classical bits and qubits.
Where the private key are classical bit
and public key are qubits. The public
key are generated through private key.
We analyze the performance and
security of the scheme. Our scheme
ensures the information-theoretic
secure and can be implemented
easily.
15 Beyond Binary: The Capabilities of
Classical and Quantum Computing for
Securing Data Transmission
PDF: Available
Author: B.V.N. Prasad Paruchuri, Madhu
Latha Veerapaneni, G. Rames, Vinay
Kumar Awaar, Abhilasha Chauhan
Citation Count: 0
Journal: E3S Web of Conferences
Publication Date: None
DOI: 10.1051/e3sconf/202343001073
Quantum
computing can
break encryption
through quantum
key distribution
and
property-based
cryptography.
[1] Extracted Source
In the present times, the demand for
sophisticated encryption methods has
escalated, especially for securing data
transmission in vulnerable
environments. These methods
leverage diverse algorithms to fortify
the integrity of communication
channels. Quantum mechanics plays a
pivotal role in two specific areas:
quantum key distribution and
property-based cryptography, both of
which contribute to establishing secure
communication protocols. This study
focuses on conducting a comparative
evaluation of classical and quantum
cryptography, employing various
cryptography algorithms. The objective
is to ascertain the optimal algorithm
within each realm classical and
quantum cryptography for ensuring
robust security.
16 Exploration of Power Side-Channel
Vulnerabilities in Quantum Computer
Controllers
PDF: Available
Author: Chuan Xu, Ferhat Erata, Jakub
Szefer
Citation Count: 7
Journal: Conference on Computer and
Communications Security
Publication Date: 2023-11-15
DOI: 10.1145/3576915.3623118
Physical attacks,
such as
power-based
side-channel
attacks, could be
used to extract
sensitive
information about
the circuits being
executed on
quantum
computers,
leading to the
potential break of
encryption.
[1] Extracted Source
The rapidly growing interest in
quantum computing also increases the
importance of securing these
computers from various physical
attacks. Constantly increasing qubit
counts and improvements to the
fidelity of the quantum computers hold
great promise for the ability of these
computers to run novel algorithms with
highly sensitive intellectual property.
However, in today''s cloud-based
quantum computer setting, users lack
physical control over the computers.
Physical attacks, such as those
perpetrated by malicious insiders in
data centers, could be used to extract
sensitive information about the circuits
being executed on these computers.
This work shows the first exploration
and study of power-based
side-channel attacks in quantum
computers. The explored attacks could
be used to recover information about
the control pulses sent to these
computers. By analyzing these control
Source Source Information Insight Related
to Question Relevant Extracts
pulses, attackers can
reverse-engineer the equivalent
gate-level description of the circuits,
and the algorithms being run, or data
hard-coded into the circuits. This work
introduces five new types of attacks,
and evaluates them using control
pulse information available from
cloud-based quantum computers. This
work demonstrates how and what
circuits could be recovered, and then
in turn how to defend from the newly
demonstrated side-channel attacks on
quantum computing systems.
17 Making existing software quantum safe: A
case study on IBM Db2
PDF: Available
Author: Lei Zhang, Andriy Miranskyy, Walid
Rjaibi, Greg Stager, Michael A. Gray, J.S.
Peck
Citation Count: 2
Journal: Elsevier BV
Publication Date: 2023-09-01
DOI:
https://doi.org/10.1016/j.infsof.2023.107249
Shor's algorithm
running on
quantum
computers can
break asymmetric
encryption
algorithms that
classical
computers
cannot.
[1] Extracted Source
The software engineering community
is facing challenges from quantum
computers (QCs). In the era of
computing, Shor''s algorithm running
on QCs can break asymmetric
encryption algorithms that classical
practically cannot. Though exact date
when will become "dangerous" for
practical problems unknown,
consensus this future near. Thus,
needs to start making ready attacks
and ensure safety proactively. We
argue problem evolving existing
quantum-safe very similar Y2K bug.
we leverage some best practices bug
propose our roadmap, called 7E,
which gives developers a structured
way prepare attacks. It intended help
planning creation new evolution
cryptography in software. paper, use
case study validate viability 7E. Our
under IBM Db2 database system.
upgrade current cryptographic
schemes post-quantum ones (using
Kyber Dilithium schemes) report
findings lessons learned. show 7E
roadmap effectively plans security
features towards safety, but it does
require minor revisions. incorporate
experience with into revised roadmap.
U.S. Department Commerce''s
National Institute Standards
Technology finalizing standard. getting
prepared advantage era. hope
experiential manner.
18 Preparing for a Quantum Future: Strategies
for Strengthening International Data
Privacy in the Face of Evolving
Technologies
PDF: Available
Author: Islombek Abdikhakimov
Citation Count: 0
Developing
quantum-resistant
cryptography and
adopting
privacy-enhancing
technologies.
[1] Extracted Source
As quantum computing advances, the
potential threat to data privacy
intensifies, necessitating a proactive
approach to strengthen international
data protection measures. This article
explores the current state of data
privacy, the impact of quantum
computing, and proposes strategies
for addressing the challenges and
Source Source Information Insight Related
to Question Relevant Extracts
Journal: International journal of law and
policy
Publication Date: 2024-05-30
DOI: 10.59022/ijlp.189
opportunities presented by this
evolving technology. Through a
comprehensive literature review and
expert interviews, we identify key
areas for improvement and provide
recommendations for policymakers,
organizations, and individuals to
enhance data privacy in the quantum
era. The findings highlight the
importance of developing
quantum-resistant cryptography,
adopting privacy-enhancing
technologies, fostering international
cooperation, and investing in research
and development efforts to ensure the
protection of sensitive data in the face
of quantum computing.
19 Leveraging the power of quantum
computing for breaking RSA encryption
PDF: Not Available
Author: Moolchand Sharma, Vikas
Choudhary, R. Bhatia, Sahil Malik,
Anshuman Raina, Harshit Khandelwal
Citation Count: 10
Journal: Cyber-Physical Systems
Publication Date: 2020-09-03
DOI: 10.1080/23335777.2020.1811384
Quantum
computing can
break RSA
encryption by
mapping qubits to
a constraint
satisfaction
problem, making
factorization
easier and
breaking the
encryption
security.
[1] Extracted Source
ABSTRACT Encryption is the process
of securing confidential data that bars
a third partys access to the
information.RSA encryption utilises the
property of complexity classes wherein
the problem of prime integer
factorization lies inside the
Non-Polynomial time (NP-Hard) class,
which makes it impervious to classical
computers. Since it is so hard to break
even for a computer, it becomes
important to do encryption for all the
secure transactions. Although it lies
outside the capabilities of traditional
computing, the recent developments in
the field of quantum computing can be
utilised to break RSA Encryption. The
approach involves mapping of qubits
used in a quantum machine to a
constraint satisfaction problem (CSP)
and then using them to check for
factors. This consists of the use of a
Multiplicative Boolean circuit in which
the qubits utilised by the machine
replaces the variables. These Qubits
are then mapped as per the gates
involved, and the factorization problem
is thus transformed into a CSP
problem, through which, the factors
can be easily found. Once known,
these factors can be used to calculate
the public and private keys effectively
breaking the encryption security. We
provide a novel approach to highlight
the importance of developing
Post-Quantum cryptography
techniques for providing a secure
channel of communication.
20 Analyzing the Impact of Quantum
Cryptography on Network Security
PDF: Not Available
Quantum
computing can
break encryption
by making
[1] Extracted Source
Quantum cryptography is a field that
employs principles of quantum physics
to communicate via networks. It has
Source Source Information Insight Related
to Question Relevant Extracts
Author: Sanjaikanth E Vadakkethil
Somanathan Pillai, Kiran Polimetla
Citation Count: 2
Journal: None
Publication Date: 2024-02-23
DOI:
10.1109/ICICACS60521.2024.10498417
conventional
encryption
methods more
susceptible to
attacks that could
compromise
encryption keys.
developed as an ability to handle the
growing risks to network security,
including cyber-attacks and data
breaches. This age offers superior and
advanced security characteristics
compared to traditional cryptographic
systems, making it a highly promising
choice for safeguarding sensitive data.
Quantum cryptography provides
secure communication channels that
are resistant to eavesdropping and
hacking. Quantum key distribution
(QKD) algorithms are utilized to
generate and distribute encryption
keys by using the distinct properties of
quantum particles. Intercepting the
keys without altering their quantum
state is exceedingly difficult, requiring
precise manipulation. Quantum
cryptography has a notable effect on
community defense by effectively
mitigating the threat posed by
quantum computing. Due to the rise of
quantum computing, conventional
encryption methods are becoming
more susceptible to attacks that could
compromise the security of encryption
keys.
21 On Quantum Chosen-Ciphertext Attacks
and Learning with Errors
PDF: Available
Author: G. Alagic, S. Jeffery, M. Ozols,
Alexander Poremba
Citation Count: 10
Journal: IACR Cryptology ePrint Archive
Publication Date: 2018-08-29
DOI: 10.3390/cryptography4010010
Quantum
computing can
break encryption
by allowing
adversaries to
recover secret
keys with constant
success
probability using
quantum
decryption
queries.
[1] Extracted Source
Large-scale quantum computing
poses a major threat to classical
public-key cryptography. Recently,
strong quantum access security
models have shown that numerous
symmetric-key cryptosystems are also
vulnerable. In this paper, we consider
classical encryption in a model that
grants the adversary quantum oracle
access to encryption and decryption,
but where we restrict the latter to
non-adaptive (i.e., pre-challenge)
queries only. We formalize this model
using appropriate notions of ciphertext
indistinguishability and semantic
security (which are equivalent by
standard arguments) and call it QCCA
1 in analogy to the classical CCA 1
security model. We show that the
standard pseudorandom function (
PRF )-based encryption schemes are
QCCA 1 -secure when instantiated
with quantum-secure primitives. Our
security proofs use a strong bound on
quantum random-access codes with
shared randomness. Revisiting plain
IND CPA -secure Learning with Errors
( LWE ) encryption, we show that
leaking only a single quantum
decryption query (and no other
leakage or queries of any kind) allows
the adversary to recover the full secret
Source Source Information Insight Related
to Question Relevant Extracts
key with constant success probability.
Information-theoretically, full recovery
of the key in the classical setting
requires at least a linear number of
decryption queries. Our results thus
challenge the notion that LWE is
unconditionally just as secure
quantumly as it is classically. The
algorithm at the core of our attack is a
new variant of the well-known
BernsteinVazirani algorithm. Finally,
we emphasize that our results should
not be interpreted as a weakness of
these cryptosystems in their stated
security setting (i.e., post-quantum
chosen-plaintext secrecy). Rather, our
results mean that, if these
cryptosystems are exposed to
chosen-ciphertext attacks (e.g., as a
result of deployment in an
inappropriate real-world setting) then
quantum attacks are even more
devastating than classical ones.
22 Quantum Security for IoT to Secure
Healthcare Applications and Their Data
PDF: Not Available
Author: B. Kumar, Sheetal B. Prasad,
Parashu Ram Pal, Pankaj Pathak
Citation Count: 0
Journal: None
Publication Date: None
DOI: 10.4018/978-1-7998-6677-0.CH008
Quantum
computing can
break encryption
by exploiting
security gaps in
the healthcare
industry.
[1] Extracted Source
Quantum computation has the ability
to revolutionize the treatment of
patients. Quantum computing can help
to detect diseases by identifying and
forecasting malfunctions. But there''s a
threat associated here (i.e., healthcare
data among the most popular
cybercriminal targets, IoT devices
notoriously lacking in effective
safeguards, and quantum computers
on the brink of an
encryption/decryption breakthrough).
Health agencies need a security
prognosis and treatment plan as soon
as possible. Healthcare companies
recently worry more about the
quantum security threats. The biggest
threat of healthcare data breaches has
come in the form of identity theft.
There should be a strong mechanism
to combat the security gaps in existing
healthcare industry. If the healthcare
data are available on the network, an
attacker may try to modify, intercept,
or even view this data stream. With
the use of quantum security, the
quantum state of these photons
changes alert the security pros that
someone is trying to breach the link.
23 Evaluation Framework for Quantum
Security Risk Assessment: A
Comprehensive Study for Quantum-Safe
Migration
PDF: Not Available
Quantum
computing can
break encryption
by undermining
current
cryptographic
algorithms and
[1] Extracted Source
The rise of large-scale quantum
computing poses a significant threat to
traditional cryptographic security
measures. Quantum attacks
undermine current asymmetric
cryptographic algorithms, rendering
Source Source Information Insight Related
to Question Relevant Extracts
Author: Yaser Baseri, Vikas Chouhan, Ali
Ghorbani, Aaron Chow
Citation Count: 0
Journal: arXiv.org
Publication Date: 2024-04-12
DOI: 10.2139/ssrn.4750609
making them
ineffective, posing
a significant threat
to traditional
security
measures.
them ineffective. Even symmetric key
cryptography is vulnerable, albeit to a
lesser extent, suggesting longer keys
or extended hash functions for
security. Thus, current cryptographic
solutions are inadequate against
emerging quantum threats.
Organizations must transition to
quantum-safe environments with
robust continuity plans and meticulous
risk management. This study explores
the challenges of migrating to
quantum-safe cryptographic states,
introducing a comprehensive security
risk assessment framework. We
propose a security risk assessment
framework that examines
vulnerabilities across algorithms,
certificates, and protocols throughout
the migration process (pre-migration,
during migration, post-migration). We
link these vulnerabilities to the
STRIDE threat model to assess their
impact and likelihood. Then, we
discuss practical mitigation strategies
for critical components like algorithms,
public key infrastructures, and
protocols. Our study not only identifies
potential attacks and vulnerabilities at
each layer and migration stage but
also suggests possible
countermeasures and alternatives to
enhance system resilience,
empowering organizations to construct
a secure infrastructure for the
quantum era. Through these efforts,
we establish the foundation for
enduring security in networked
systems amid the challenges of the
quantum era.
24 A Novel Low-Power Encryption Scheme
Based on Chaotic Dynamic Triple
Pendulum System for Wide Range of
Applications
PDF: Available
Author: Bikram Paul
Citation Count: 0
Journal: None
Publication Date: 2021-06-18
DOI: 10.36227/TECHRXIV.14778129.V1
Quantum
computing can
break encryption
by executing
Shors and
Grovers
algorithms on
popular symmetric
and asymmetric
cryptosystems like
RSA, ECC, DES,
and
Diffie-Hellman.
[1] Extracted Source
Recent advancements in the domain
of quantum computing are posing a
security threat to the classical
cryptography algorithms. Popular
symmetric and asymmetric
cryptosystems including RSA, ECC,
DES, Diffie-Hellman etc. can be
broken by a quantum computer
executing Shors and Grovers
algorithms. This motivated scientific
community to design newer encryption
schemes to address security
vulnerabilities. Hash, Code, Lattice,
Multivariate Polynomial based
cryptography algorithms, known as
post-quantum cryptography algorithms
(PQC), exhibit resistance against
classical as well as quantum
crypto-attacks. Apart from these PQC
algorithms, a relatively new method of
Source Source Information Insight Related
to Question Relevant Extracts
constructing cryptosystems utilizing
the unpredictability property of discrete
chaotic dynamic systems has become
noteworthy from the practical
perspective. In this paper, we present
a novel approach to design an
encryption scheme based on the
chaotic dynamic physical system,
which is derived from a mechanical
model depicting nonlinear dynamics
and exhibits resistance against various
attacks. The effectiveness of the
proposed cryptography scheme is
validated against various standard
tests, such as Lyapunov exponents
test, bifurcation diagrams, sensitivity
to parametric and to initial values,
ergodicity, collision test, NIST, diehard
randomness test etc. This algorithm is
also verified through an FPGA
implementation to assess its usage in
low power high throughput
applications as well. The power
consumption and resource utilization
of the proposed design are 56 % and
72.6 %, respectively, as compared to
other known methods while operating
at 628.14 MHz. It is observed that the
proposed design can work efficiently
with various wide range of
applications. It is observed that the
proposed design can work efficiently
with various wide range of
applications. The average power and
area of its ASIC implementation at 180
nm technology are 61.8836 mW and
0.20374 mm 2 at 250 MHz,
respectively.
