Newest papers

PQC Migration of IPsec: Reliable Composite Key Sharing Mechanisms in IKEv2

Rahul, Manjesh K. Hanawal, Sameer G. Kulkarni, Tirumaleswar Reddy K · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.25799 · cited by 0 works (OpenAlex) · open-access PDF

French

La menace des ordinateurs quantiques qui brisent la cryptographie classique est d'accélérer l'adoption des algorithmes de cryptographie quantique résistant au pac. Plusieurs agences gouvernementales ont mis en place une ligne de temps serrée pour la mise à niveau de tous les systèmes pour soutenir les cryptographies quantiques post-post. Nous étudions la migration post-quantique des protocoles IPSec et leur impact sur la performance du réseau. Les grandes longueurs de clé dans la cryptographie post-quantique (PQC) ne peuvent pas s'adapter à un seul paquet IP conduisant à la fragmentation de l'IP. Cela peut entraîner l'échec des associations de sécurité et la dégradation des performances d'IKEv2 dans de mauvaises conditions

Machine translation (Meta M2M100); the English original follows.

Abstract

The threat of quantum computers breaking classical cryptographic is accelerating the adoption of quantum- resistant cryptographic algorithms. Several government agencies have set a tight time-line for upgradation of all system to support post quantum cryptographs. We study post-quantum migration of IPSec protocols and their impact on network performance. The large key lengths in Post-Quantum Cryptography (PQC) cannot fit in a single IP packet leading to IP fragmentation. This can cause failure of security associations and degrade performance of IKEv2 under poor network conditions. To tackle this problem, we study a new key- sharing mechanism for IKEv2 and evaluate its performance. Unlike current hybrid key-sharing approaches, which send the classical and quantum keys sequentially over UDP or TCP (as in RFC 9370), the new approach concatenates them into a single composite key and transport them over TCP to ensure a reliable handshake. We implement and benchmark the new composite key-sharing handshake mechanism against existing hybrid algorithms that use either UDP or TCP. Extensive experiments under various network conditions demonstrate that the new approach significantly improves handshake time and energy consumption by avoiding the severe retransmission penalties of the Hybrid handshake mechanism. At 1% packet loss, the handshake time of composite key sharing mechanism is better by atleast 20% than hybrid mechanisms, and the improve- ment get better with higher packet loss reaching 30% at 10% packet loss. Energy consumption follows the same pattern achieving reduction of 29% at 10% packet loss

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Handshake, Computer network, Computer science, Network packet, Retransmission, Packet loss

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.25799, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange