Analyzing post-quantum cryptographic algorithms efficiency for transport security layer

Abstract

The development of post-quantum computing has increasingly put at risk the viability of classical public-key cryptographic schemes. The National Institute of Standards and Technology (NIST) is actively working on standardizing post-quantum cryptography (PQC) algorithms, and this research assesses the performance of two fourth-round finalists: BIKE and Classic McEliece, within the Transport Layer Security (TLS) context. With OQS’s OpenSSL implementation, we benchmark key generation, encapsulation, decapsulation, and TLS handshake latency across multiple algorithm variants and operating systems. Our results illustrate that BIKE-L1 demonstrates the lowest TLS handshake latency of 6 ms and performs well on Linux, positioning it as optimal for secure communication when minimal delay is needed. In contrast, the Classic McEliece variants provide robust encryption security but have large key sizes coupled with high computational burdens, especially on Windows systems. These results inform the selection of PQC algorithms based on the limitations of the implementation platform, outline the objectives for the operation efficiency of algorithms, and help guide future research focused on optimization and deployment within real-world cryptographic systems.