Neural Key Agreement Protocol with Extended Security

Neural Key Agreement Protocol with Extended Security | 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 Research Article Neural Key Agreement Protocol with Extended Security Mihail-Iulian Plesa, Marian Gheorghe, Florentin Ipate This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4657873/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Key agreement protocols based on neural synchronization using Tree Parity Machines (TPMs) have two main advantages: their security does not involve trapdoor problems, which may be solved on a quantum computer, and, unlike their quantum counterparts, they do not require special hardware, which is expensive and difficult to manage. In this paper, we present a new protocol for synchronizing two TPMs. Our network construction uses non-binary inputs with positive bounded weights. We analyzed all major known attacks on TPMs and experimentally proved that the percentage of the key recovered by the attacker drops exponentially in the system's parameters. At the same time, the number of rounds of the protocol increases only polynomially. Neural cryptography Key agreement Tree Parity Machine Cryptography Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-4657873","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":360488414,"identity":"c2efb75a-c485-4370-9954-deb97fb128fa","order_by":0,"name":"Mihail-Iulian Plesa","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABGUlEQVRIiWNgGAWjYDACdjApkcDAzNxwgKFAAijSABQwsMCthRmuhRGoxQCohecASIsEIS0MCQwMjEDTDSDaQSROHebMzIc//MyxyONvZ2w8zGNgIW8u+fzqhh9AF/K3dydg02LZzJYm2btNoljiMGMDUIuE4c7ZOWU3e4AOkzhzdgM2LQaHecwYeLdJJDZAtTBuuJ2TdgPIAHonF4cW/s8f/wK1zIdqsd9w80zazT94tfAwSINs2QDVkrjhBvux2/hsAfrFTFoWqGUjUMvBOQYSyRvO5LDdljGQ4MHlF3P25scf326rS5x3/vDhD28q6mw3HD/+7OabPzZy/O292B2GRYwHLMiDTTkuLewPcKkeBaNgFIyCkQkA3WNkNyhzJ+cAAAAASUVORK5CYII=","orcid":"","institution":"University of Bucharest","correspondingAuthor":true,"prefix":"","firstName":"Mihail-Iulian","middleName":"","lastName":"Plesa","suffix":""},{"id":360488415,"identity":"e124f482-6e2b-4c56-aa93-d7f192882736","order_by":1,"name":"Marian Gheorghe","email":"","orcid":"","institution":"University of Bradford","correspondingAuthor":false,"prefix":"","firstName":"Marian","middleName":"","lastName":"Gheorghe","suffix":""},{"id":360488417,"identity":"7f5ecc7f-eb0d-4069-9e5c-2d5dd613e630","order_by":2,"name":"Florentin Ipate","email":"","orcid":"","institution":"University of Bucharest","correspondingAuthor":false,"prefix":"","firstName":"Florentin","middleName":"","lastName":"Ipate","suffix":""}],"badges":[],"createdAt":"2024-06-29 06:38:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4657873/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4657873/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":85167585,"identity":"20bef5cc-78c4-4613-bfeb-ea3e144a8db1","added_by":"auto","created_at":"2025-06-23 04:31:48","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":425538,"visible":true,"origin":"","legend":"","description":"","filename":"SpringerNeuralKeyAgreementProtocolwithExtendedSecurity.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4657873/v1_covered_5073f039-522c-44b4-8a33-f779fa0c0934.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Neural Key Agreement Protocol with Extended Security","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Neural cryptography, Key agreement, Tree Parity Machine, Cryptography","lastPublishedDoi":"10.21203/rs.3.rs-4657873/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4657873/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Key agreement protocols based on neural synchronization using Tree Parity Machines (TPMs) have two main advantages: their security does not involve trapdoor problems, which may be solved on a quantum computer, and, unlike their quantum counterparts, they do not require special hardware, which is expensive and difficult to manage. In this paper, we present a new protocol for synchronizing two TPMs. Our network construction uses non-binary inputs with positive bounded weights. We analyzed all major known attacks on TPMs and experimentally proved that the percentage of the key recovered by the attacker drops exponentially in the system's parameters. At the same time, the number of rounds of the protocol increases only polynomially. ","manuscriptTitle":"Neural Key Agreement Protocol with Extended Security","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-01-20 14:09:41","doi":"10.21203/rs.3.rs-4657873/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"5fce9a3f-c5a7-4f35-9212-adba7246dcbe","owner":[],"postedDate":"January 20th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-06-23T04:23:41+00:00","versionOfRecord":[],"versionCreatedAt":"2025-01-20 14:09:41","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4657873","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4657873","identity":"rs-4657873","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}