A Comparative Performance Evaluation of Kyber, sntrup761, and FrodoKEM for Post-Quantum Cryptography

• URL: http://arxiv.org/abs/2508.10023v1
• Date: Thu, 07 Aug 2025 19:39:59 GMT
• Title: A Comparative Performance Evaluation of Kyber, sntrup761, and FrodoKEM for Post-Quantum Cryptography
• Authors: Samet Ünsal,
• Abstract summary: Post-quantum cryptography aims to develop cryptographic algorithms that are secure against attacks from quantum computers.<n>This paper compares the leading postquantum cryptographic algorithms, such as Kyber, sntrup761, and FrodoKEM, in terms of their security, performance, and real-world applicability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Post-quantum cryptography (PQC) aims to develop cryptographic algorithms that are secure against attacks from quantum computers. This paper compares the leading postquantum cryptographic algorithms, such as Kyber, sntrup761, and FrodoKEM, in terms of their security, performance, and real-world applicability. The review highlights the strengths and weaknesses of each algorithm and provides insights into future research directions. We also discuss the challenges of transitioning from classical to post-quantum systems and the potential impacts on various industries. This paper serves as a foundation for understanding the current state of post-quantum cryptography and its future prospects in the quantum computing era.

Related papers

• Practical quantum tokens: challenges and perspectives [49.583101345036624]
  The concept of quantum tokens dates back alongside quantum cryptography to Stephen Wiesner's seminal work in 1983.<n>We discuss the current state-of-the-art of quantum tokens in the field of quantum information, as well as their future perspectives.
  arXiv  Detail & Related papers  (2026-02-11T08:11:36Z)
• Literature Review of the Effect of Quantum Computing on Cryptocurrencies using Blockchain Technology [0.0]
  This paper presents a literature review evaluating how quantum algorithms, specifically Shors and Grovers, could disrupt the foundational security mechanisms of cryptocurrencies.<n>This review identifies specific vulnerabilities in transaction and consensus processes in Bitcoin, Litecoin, Monero, and Zcash.<n>In anticipation, it investigates countermeasures including Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD), and protocol-level modifications such as memory-intensive proof-of-work algorithms and multi-signature schemes.
  arXiv  Detail & Related papers  (2025-08-24T10:53:41Z)
• A tertiary review on quantum cryptography [0.4419843514606336]
  Quantum cryptography uses the principle of quantum physics to produce theoretically unbreakable security.<n>The results showed a prevalence of QKD over other techniques among the selected papers.<n>The field still faces many problems related to implementation cost, error correction, decoherence, key rates, communication distance, and quantum hacking.
  arXiv  Detail & Related papers  (2025-05-29T20:00:56Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• 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.<n>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)
• Applications of Post-quantum Cryptography [0.0]
  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.
  arXiv  Detail & Related papers  (2024-06-19T06:45:39Z)
• 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)
• Cryptography: Classical versus Post-Quantum [0.0]
  We discuss the advantages of post-quantum cryptography over classical cryptography. We conclude that the development of post-quantum cryptography is essential to guarantee the security of sensitive information in the post quantum era.
  arXiv  Detail & Related papers  (2024-02-16T10:56:45Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• 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.