Performance Evaluation and Security Analysis of Hybrid Classical-Quantum Cryptographic Schemes for Future-Proof Network Security

Performance Evaluation and Security Analysis of Hybrid Classical-Quantum Cryptographic Schemes for Future-Proof Network Security | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 5 February 2026 V1 Latest version Share on Performance Evaluation and Security Analysis of Hybrid Classical-Quantum Cryptographic Schemes for Future-Proof Network Security Authors : MD. SOFIKUL ISLAM 0009-0006-8731-0571 [email protected] and Md Sofikul Islam Authors Info & Affiliations https://doi.org/10.22541/au.177031431.13915156/v1 130 views 64 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract Quantum computers are approaching rapidly, and they act as a significant threat to the security systems we use today, such as RSA and Elliptic Curve Cryptography (ECC). These conventional systems can be easily broken by new quantum algorithms. To fix this problem and bridge the gap between current security and future protection, this paper builds and tests a "hybrid" cryptographic system. We combined a standard method called X25519 with a new Post-Quantum Cryptography (PQC) method called ML-KEM (Kyber-768). We tested this system on a computer running WSL2-Ubuntu using the Open Quantum Safe (OQS) library. In this study, we did not just check the speed; we also performed a detailed statistical analysis, checked resource usage, and provided a security proof. Our results show that the system is very fast (taking only about 0.10 ms) and does not slow down the network. This proves that our hybrid system is practical and ready to use for secure communication in real-time. Supplementary Material File (hybrid classical quantum.pdf) Download 235.14 KB Information & Authors Information Version history V1 Version 1 05 February 2026 Copyright This work is licensed under a Creative Commons Attribution 4.0 International License Keywords hybrid system kyber-768 ml-kem network security post-quantum cryptography statistical analysis Authors Affiliations MD. SOFIKUL ISLAM 0009-0006-8731-0571 [email protected] View all articles by this author Md Sofikul Islam Department of Computer Science and Engineering, Rabindra Maitree University Kushtia View all articles by this author Metrics & Citations Metrics Article Usage 130 views 64 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation MD. SOFIKUL ISLAM, Md Sofikul Islam. Performance Evaluation and Security Analysis of Hybrid Classical-Quantum Cryptographic Schemes for Future-Proof Network Security. Authorea . 05 February 2026. DOI: https://doi.org/10.22541/au.177031431.13915156/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.177031431.13915156/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9fe3a06c3e08ad07',t:'MTc3OTE5OTIxMw=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();