Performance Evaluation of NIST Post-Quantum Cryptographic Key Encapsulation Mechanisms in a Virtualized Software Environment
This paper evaluates the performance of NIST-standardized CRYSTALS-Kyber algorithms against classical RSA and ECDH in a virtualized environment, demonstrating that Kyber offers faster key generation than RSA and comparable efficiency to ECDH, thereby confirming its practicality for future quantum-resistant deployments.
Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
The digital world relies on a set of invisible locks to keep our secrets safe. For decades, these locks have been built on mathematical puzzles that are easy to create but nearly impossible to solve without a specific key. Two of the most common puzzles involve breaking down huge numbers into their building blocks or finding patterns in complex curves. Today, almost every secure connection on the internet, from online banking to private messages, depends on these puzzles remaining unsolvable by ordinary computers. However, a new kind of computer is on the horizon. These machines, known as quantum computers, operate on different physical principles that allow them to solve these specific puzzles with frightening speed. If such a machine were built, it could unlock the vast majority of our current digital security, rendering the old locks useless.
To prepare for this future, scientists are designing new types of locks that are built on different mathematical foundations, ones that even these powerful future machines cannot easily break. This field is called post-quantum cryptography. The United States government's standards agency, NIST, recently selected a specific family of these new algorithms to become the official replacement for the old ones. One of the most promising candidates is a system based on the geometry of multi-dimensional grids, which creates a new kind of lock that is both secure and efficient. But before these new locks can be installed in the servers and software that run our world, they must be tested to ensure they work quickly and reliably in the real environment where they will live.
A researcher named Chirag Gupta set out to test exactly how well these new digital locks perform when running inside the virtual machines that power much of the modern internet. Unlike physical servers that sit in a single location, virtual machines are software simulations of computers that run inside other computers. They are the workhorses of the cloud, hosting websites, databases, and applications. Because so much of our digital life happens in these virtual spaces, it is critical to know if the new quantum-resistant algorithms can handle the extra overhead of running in a simulated environment without slowing things down. Gupta focused on a specific new algorithm called ML-KEM, which was formerly known as CRYSTALS-Kyber, and compared it against the two most common old algorithms, RSA and ECDH, to see how they stack up in speed and size.
The experiment took place in a controlled software environment that mimicked a standard computer setup. The researcher ran the new quantum-resistant algorithms alongside the old ones, measuring exactly how long it took to perform three essential tasks: creating a new pair of keys, locking a message with a public key, and unlocking it with a private key. The tests were repeated thousands of times to ensure the results were stable and accurate. The findings revealed a striking difference in how these systems operate. The old RSA algorithm, which has been the standard for decades, took an average of nearly thirty-four milliseconds to generate a new key. In contrast, the new ML-KEM algorithms generated their keys in less than three hundredths of a millisecond. This means the new system is thousands of times faster at creating keys than the current standard, a massive leap in efficiency.
When compared to the other common modern algorithm, ECDH, the new system performed just as well, with both generating keys in roughly the same tiny fraction of a second. The time required to lock and unlock messages was also incredibly fast, measured in fractions of a millisecond for all versions of the new system. This speed suggests that switching to these new algorithms will not cause the lag or delays that often worry network administrators. The only trade-off observed was in the size of the keys themselves. The new algorithms require larger public keys to function, ranging from eight hundred bytes to over fifteen hundred bytes depending on the security level chosen. While this is larger than the keys used by the old systems, the study found that this increase in size is manageable and does not outweigh the benefits of the speed and security gains.
The research confirms that these new lattice-based algorithms are not just theoretical concepts but are practical tools ready for deployment in the software environments that run our daily lives. The data shows that the new system handles the computational demands of a virtualized setting with ease, offering a secure path forward without sacrificing performance. While the study focused specifically on these key generation and locking tasks, the results provide a strong foundation for confidence in the transition. The new locks are fast, they are secure against future threats, and they fit comfortably within the virtual machines that power the internet. As organizations prepare to upgrade their security to withstand the arrival of quantum computing, this work demonstrates that the new standard is a viable and efficient solution for the software-driven world of tomorrow.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.