Migration of Network Protocols to Post-Quantum Cryptography (PQC): Performance Challenges, Key Size Issues, and Hybrid Solutions in TLS ۱.۳, IPsec, and QUIC

سال انتشار: 1405
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 33

فایل این مقاله در 18 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ITNAF01_1352

تاریخ نمایه سازی: 14 آبان 1405

چکیده مقاله:

The rapid progress toward cryptographically relevant quantum computers poses an existential threat to the public-key primitives (RSA, ECC) that secure TLS ۱.۳, IPsec, and QUIC, enabling harvest-now-decrypt-later attacks on long-lived network traffic. This paper presents the first comprehensive cross-protocol performance evaluation of post-quantum cryptography migration using the NIST-standardized algorithms ML-KEM and ML-DSA under realistic ۲۰۲۶ network conditions. We compare classical (X۲۵۵۱۹ + ECDSA), hybrid (X۲۵۵۱۹ + ML-KEM-۷۶۸ with ML-DSA-۷۶۸), and pure post-quantum configurations across TLS ۱.۳, IPsec/IKEv۲, and QUIC. Experiments were conducted on production-grade implementations (OpenSSL with liboqs and strong Swan) under controlled latency (۰-۵۰ ms), bandwidth (۱۰۰ Mbps-۱۰ Gbps), packet loss (۰-۵ %), and MTU constraints, with over ۱,۰۰۰ iterations per configuration and statistical reporting of median, p۹۵, and p۹۹ latencies. Results show that hybrid key exchange introduces only modest overhead in TLS ۱.۳ (۸–۱۲% median handshake latency increase, ~۱.۴-۱.۶ KB extra bytes on the wire) while remaining largely unaffected by fragmentation due to TCP. In contrast, UDP-based protocols suffer significantly: IPsec experiences ۶۵-۷۲ % fragmentation probability without mitigation (reduced to <۸ % with IKE INTERMEDIATE at the cost of ۲۲-۳۵ % added latency), and QUIC shows ۱۵-۲۴ % latency increase that worsens to ۳۱-۴۲ % under packet loss. Pure post-quantum configurations consistently underperform hybrids. Energy measurements on edge-class hardware and high-concurrency server tests further highlight practical constraints.

نویسندگان

Mohammad Iman Golzari

Computer Science student Computer Department of Vahdat-Torbat Jam Institute of Higher Education

Rezvan Sharifi

Computer Science student Computer Department of Vahdat-Torbat Jam Institute of Higher Education

Amir Hosein Asady

Computer Science student Computer Department of Vahdat-Torbat Jam Institute of Higher Education

Muhammad Hosein Kalali

Computer Department of Vahdat-Torbat Jam Institute of Higher Education

Behzad Molavi

Department of Computer Science of Vahdat-Torbat Jam Institute of Higher Education

Mostafa Farhadi-Moghadam

Department of Computer Science of Vahdat-Torbat Jam Institute of Higher Education