Optimal Key Forwarding Strategy in QKD Behaviours

Optimal Key Forwarding Strategy in QKD Behaviours | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Optimal Key Forwarding Strategy in QKD Behaviours Alin-Bogdan Popa, Pantelimon George Popescu This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4077329/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 17 Jun, 2024 Read the published version in Scientific Reports → Version 1 posted 10 You are reading this latest preprint version Abstract Nowadays QKD plays a critical role in unconditionally-secure and quantum-safe key distribution. Commercially available QKDdevices are getting more popular for institutional and governmental national and international networks, but are expensive andoffer limited key rates. We provide a formalization of QKD-generated key forwarding and redistribution at the KMS level byextending the network graph of physical QKD links to the complete graph with logical links, and we investigate its application onthree practical scalable scenarios (all-to-all, one-to-all, one-to-one). We define a maximization goal for each scenario, andprovide a linear programming problem statement to compute the optimal redistribution. We perform an extensive analysis ofthe algorithm in terms of forwarding results and key consumption on simulated QKD networks and discuss the implications ofnetwork size and graph topology on the algorithm’s performance and complexity. Physical sciences/Physics/Quantum physics/Quantum information Physical sciences/Engineering/Electrical and electronic engineering Physical sciences/Mathematics and computing/Computer science Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 17 Jun, 2024 Read the published version in Scientific Reports → Version 1 posted Editorial decision: Revision requested 16 May, 2024 Reviews received at journal 29 Apr, 2024 Reviews received at journal 25 Apr, 2024 Reviewers agreed at journal 20 Apr, 2024 Reviewers agreed at journal 19 Apr, 2024 Reviewers invited by journal 21 Mar, 2024 Editor assigned by journal 21 Mar, 2024 Editor invited by journal 21 Mar, 2024 Submission checks completed at journal 21 Mar, 2024 First submitted to journal 11 Mar, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4077329","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":282991577,"identity":"0505fccc-c160-49ef-a5a4-46210d449aa1","order_by":0,"name":"Alin-Bogdan Popa","email":"","orcid":"","institution":"Polytechnic University of Bucharest","correspondingAuthor":false,"prefix":"","firstName":"Alin-Bogdan","middleName":"","lastName":"Popa","suffix":""},{"id":282991578,"identity":"38cd2885-4fbb-4149-8569-f555c0a2b4df","order_by":1,"name":"Pantelimon George Popescu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAtUlEQVRIiWNgGAWjYFAD9gYGZhK18BwgWYtEApFazPnXHnxcUFEnb3DzjdnjAoZ7cgS1WM54l2w848xhww23c8yNZzAUGxPUYnDjjJk0b9uBBIPbOWbSPAwJiQ3EaflXl2Bw8wyxWs73ALU0MCcY3OAhUovlDD6gX44dNpx5Jq3ceIZBAmG/mPOfBYZYTZ083/HD24BBl0A4xAwkcuDRwQbkEtQAVMN/BlnLKBgFo2AUjAIsAAC7KzkS+vlK1gAAAABJRU5ErkJggg==","orcid":"","institution":"Polytechnic University of Bucharest","correspondingAuthor":true,"prefix":"","firstName":"Pantelimon","middleName":"George","lastName":"Popescu","suffix":""}],"badges":[],"createdAt":"2024-03-11 18:16:03","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4077329/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4077329/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1038/s41598-024-64994-6","type":"published","date":"2024-06-17T15:42:33+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":58823512,"identity":"75f15a4c-b245-4c25-a26e-a329486f4d42","added_by":"auto","created_at":"2024-06-21 17:00:47","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1237302,"visible":true,"origin":"","legend":"","description":"","filename":"BalancedQKD.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4077329/v1_covered_bc3a4e13-5661-41fa-86dc-0fed76f254a5.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Optimal Key Forwarding Strategy in QKD Behaviours","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-4077329/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4077329/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Nowadays QKD plays a critical role in unconditionally-secure and quantum-safe key distribution. Commercially available QKDdevices are getting more popular for institutional and governmental national and international networks, but are expensive andoffer limited key rates. We provide a formalization of QKD-generated key forwarding and redistribution at the KMS level byextending the network graph of physical QKD links to the complete graph with logical links, and we investigate its application onthree practical scalable scenarios (all-to-all, one-to-all, one-to-one). We define a maximization goal for each scenario, andprovide a linear programming problem statement to compute the optimal redistribution. We perform an extensive analysis ofthe algorithm in terms of forwarding results and key consumption on simulated QKD networks and discuss the implications ofnetwork size and graph topology on the algorithm’s performance and complexity.","manuscriptTitle":"Optimal Key Forwarding Strategy in QKD Behaviours","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-03-27 13:37:54","doi":"10.21203/rs.3.rs-4077329/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-05-16T06:23:36+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-04-29T13:47:38+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-04-25T14:01:10+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"46cbe246-b8a4-47b4-9824-6bdc3f525c0a","date":"2024-04-20T14:09:29+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"43377598-54ea-4d5e-94f4-5174200c39c1","date":"2024-04-19T11:27:19+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-03-21T10:58:09+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-03-21T10:05:07+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2024-03-21T09:13:36+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-03-21T09:06:07+00:00","index":"","fulltext":""},{"type":"submitted","content":"Scientific Reports","date":"2024-03-11T18:04:57+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"scientific-reports","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"scirep","sideBox":"Learn more about [Scientific Reports](http://www.nature.com/srep/)","snPcode":"","submissionUrl":"","title":"Scientific Reports","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Scientific Reports","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"a5752ac4-fdea-4d99-b190-073bbf14542b","owner":[],"postedDate":"March 27th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":29797369,"name":"Physical sciences/Physics/Quantum physics/Quantum information"},{"id":29797370,"name":"Physical sciences/Engineering/Electrical and electronic engineering"},{"id":29797371,"name":"Physical sciences/Mathematics and computing/Computer science"}],"tags":[],"updatedAt":"2024-06-21T15:42:33+00:00","versionOfRecord":{"articleIdentity":"rs-4077329","link":"https://doi.org/10.1038/s41598-024-64994-6","journal":{"identity":"scientific-reports","isVorOnly":false,"title":"Scientific Reports"},"publishedOn":"2024-06-17 15:42:33","publishedOnDateReadable":"June 17th, 2024"},"versionCreatedAt":"2024-03-27 13:37:54","video":"","vorDoi":"10.1038/s41598-024-64994-6","vorDoiUrl":"https://doi.org/10.1038/s41598-024-64994-6","workflowStages":[]},"version":"v1","identity":"rs-4077329","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4077329","identity":"rs-4077329","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}