Applications of Post-quantum Cryptography

• URL: http://arxiv.org/abs/2406.13258v3
• Date: Tue, 17 Sep 2024 09:02:30 GMT
• Title: Applications of Post-quantum Cryptography
• Authors: Emils Bagirovs, Grigory Provodin, Tuomo Sipola, Jari Hautamäki,
• Abstract summary: The review employs a systematic scoping review with the scope restricted to the years 2022 and 2023. The review examined the articles on the applications of quantum computing in various spheres. The paper is analyzing various PQC algorithms, including lattice-based, hash-based, code-based, and isogeny-based cryptography.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the constantly advancing capabilities of quantum computers, conventional cryptographic systems relying on complex math problems may encounter unforeseen vulnerabilities. Unlike regular computers, which are often deemed cost-ineffective in cryptographic attacks, quantum computers have a significant advantage in calculation speed. This distinction potentially makes currently used algorithms less secure or even completely vulnerable, compelling the exploration of post-quantum cryptography (PQC) as the most reasonable solution to quantum threats. This review aims to provide current information on applications, benefits, and challenges associated with the PQC. The review employs a systematic scoping review with the scope restricted to the years 2022 and 2023; only articles that were published in scientific journals were used in this paper. The review examined the articles on the applications of quantum computing in various spheres. However, the scope of this paper was restricted to the domain of the PQC because most of the analyzed articles featured this field. Subsequently, the paper is analyzing various PQC algorithms, including lattice-based, hash-based, code-based, multivariate polynomial, and isogeny-based cryptography. Each algorithm is being judged based on its potential applications, robustness, and challenges. All the analyzed algorithms are promising for the post-quantum era in such applications as digital signatures, communication channels, and IoT. Moreover, some of the algorithms are already implemented in the spheres of banking transactions, communication, and intellectual property. Meanwhile, despite their potential, these algorithms face serious challenges since they lack standardization, require vast amounts of storage and computation power, and might have unknown vulnerabilities that can be discovered only with years of cryptanalysis.

Related papers

• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography. cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP) Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Post-Quantum Cryptography: Securing Digital Communication in the Quantum Era [0.0]
  Post-quantum cryptography (PQC) is a critical field aimed at developing resilient cryptographic algorithms to quantum attacks. This paper delineates the vulnerabilities of classical cryptographic systems to quantum attacks, elucidates impervious principles of quantum computing, and introduces various PQC algorithms.
  arXiv  Detail & Related papers  (2024-03-18T12:51:56Z)
• Post-Quantum Cryptography for Internet of Things: A Survey on Performance and Optimization [5.2804058417428275]
  Post-quantum encryption and signatures can be hard to compute. PQC may be feasible for reasonably lightweight IoT, but proposals for their optimization seem to lack standardization. We suggest future research to seek coordination, in order to ensure an efficient and safe migration toward IoT for the post-quantum era.
  arXiv  Detail & Related papers  (2024-01-31T01:47:04Z)
• Assessment of cryptographic approaches for a quantum-resistant Galileo OSNMA [4.281182764767519]
  We analyse the state of the Galileo Open Service Navigation Message Authentication (OSNMA) to overcome these new threats. The main barrier to adopting the PQC approach is the size of both the signature and the key. This work concludes by assessing different temporal countermeasures that can be implemented to sustain the system's integrity in the short term.
  arXiv  Detail & Related papers  (2023-12-18T10:20:50Z)
• A Survey on Post-Quantum Cryptography: State-of-the-Art and Challenges [4.239503938472806]
  We analyze the different types of post-quantum cryptography, quantum cryptography and quantum-resistant cryptography. We conclude that due to quantum cryptography's present limitations it is not a viable solution like it is often presented to be.
  arXiv  Detail & Related papers  (2023-12-16T12:17:44Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Simulating Noisy Quantum Circuits for Cryptographic Algorithms [0.0]
  Key algorithms used in cybersecurity are vulnerable to quantum computers. Many different quantum algorithms have been developed, which have potentially broad applications. Software co-design refers to the concurrent design of software and hardware.
  arXiv  Detail & Related papers  (2023-06-03T13:37:45Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.