Randomization of Message Contents With and Without Encryption for Covert Communication Scenarios

Randomization of Message Contents With and Without Encryption for Covert Communication Scenarios | 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 Randomization of Message Contents With and Without Encryption for Covert Communication Scenarios Pawel Rajba, Jörg Keller, Wojciech Mazurczyk This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6718778/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 25 Nov, 2025 Read the published version in International Journal of Information Security → Version 1 posted 14 You are reading this latest preprint version Abstract Steganographic methods often presuppose that the concealed message appears random or undergoes encryption. When confidentiality is a concern, encryption results in a random message, yet the exchange of keys can pose challenges and compromise clandestine communication. In situations where robust encryption is not imperative, the inquiry arises whether alternative cryptographic techniques, which are less costly than encryption, can yield equivalent levels of randomness. This will help computationally weak devices such as IoT sensors. This paper studies both research problems. Initially, we present a methodology inspired by blockchain proof-of-work to securely transmit the key alongside the encrypted message, circumventing the need for a preceding key exchange. Subsequently, we introduce frameworks utilizing cryptographic hash functions and T-functions to supplant symmetric encryption algorithms in counter mode, while also exploring lossless compression as a mechanism for achieving randomness. We outline potential scenarios where either the covert receiver or sender can undertake the proof-of-work to ensure the sender's confidentiality or authenticity. We implement all devised schemes and subject them to rigorous testing using DIEHARD and NIST STS test suites. The results obtained validate the viability of the proposed methodologies. proof-of-work network steganography covert communication randomness key exchange Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 25 Nov, 2025 Read the published version in International Journal of Information Security → Version 1 posted Editorial decision: Revision requested 29 Aug, 2025 Reviews received at journal 26 Aug, 2025 Reviews received at journal 24 Aug, 2025 Reviews received at journal 17 Aug, 2025 Reviewers agreed at journal 03 Aug, 2025 Reviewers agreed at journal 30 Jul, 2025 Reviewers agreed at journal 29 Jul, 2025 Reviewers agreed at journal 29 Jul, 2025 Reviewers agreed at journal 29 Jul, 2025 Reviewers agreed at journal 28 Jul, 2025 Reviewers invited by journal 28 Jul, 2025 Editor assigned by journal 27 May, 2025 Submission checks completed at journal 27 May, 2025 First submitted to journal 21 May, 2025 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-6718778","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":492845246,"identity":"807acefc-0025-42a9-8310-fc67bedbdc88","order_by":0,"name":"Pawel Rajba","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA1klEQVRIiWNgGAWjYLCCBxUQ+gCUz3gAh0IESDiDqgXBwAkS29AE8GoxZz9j+CBxnp09g0TuwQOMbffk+Bt4D+DVYtmTY2yQuC05sUEiLwGopdhY4gBfAl4tBgdyt0kkbjuQwCCRY3CAcVtC4gYGHgP8Ws6/3f4jcc4BexK03MjdxpDYcICxgWgtljPef5ZIOJac2MbzxuBA4r8EY4nDBPxizp+W+OFDjZ09P3uO8YcPZxLk+Nt7Dz7A6zAYgw1EJIAIZh58GpC0IAECWkbBKBgFo2DEAQA6DUvH2mN/jQAAAABJRU5ErkJggg==","orcid":"","institution":"University of Wrocław","correspondingAuthor":true,"prefix":"","firstName":"Pawel","middleName":"","lastName":"Rajba","suffix":""},{"id":492845249,"identity":"17faa385-295e-4ea7-9cb8-25a38da84458","order_by":1,"name":"Jörg Keller","email":"","orcid":"","institution":"University of Hagen","correspondingAuthor":false,"prefix":"","firstName":"Jörg","middleName":"","lastName":"Keller","suffix":""},{"id":492845251,"identity":"6fadc4b5-6fcf-4da1-92a2-b1c99abd3ce5","order_by":2,"name":"Wojciech Mazurczyk","email":"","orcid":"","institution":"Warsaw University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Wojciech","middleName":"","lastName":"Mazurczyk","suffix":""}],"badges":[],"createdAt":"2025-05-21 17:53:19","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6718778/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6718778/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s10207-025-01160-7","type":"published","date":"2025-11-25T15:57:57+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":97178739,"identity":"7045b0e1-e053-4eaa-a3e2-c2c306dfb708","added_by":"auto","created_at":"2025-12-01 16:13:11","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1202145,"visible":true,"origin":"","legend":"","description":"","filename":"IJISProofofworkbasednewencodingschemeforinformationhidingpurposes.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6718778/v1_covered_8484e54d-f487-47f2-880e-25bab79e23a2.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Randomization of Message Contents With and Without Encryption for Covert Communication Scenarios","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":"international-journal-of-information-security","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ijis","sideBox":"Learn more about [International Journal of Information Security](http://link.springer.com/journal/10207)","snPcode":"10207","submissionUrl":"https://submission.nature.com/new-submission/10207/3","title":"International Journal of Information Security","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"proof-of-work, network steganography, covert communication, randomness, key exchange","lastPublishedDoi":"10.21203/rs.3.rs-6718778/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6718778/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Steganographic methods often presuppose that the concealed message appears random or undergoes encryption. When confidentiality is a concern, encryption results in a random message, yet the exchange of keys can pose challenges and compromise clandestine communication. In situations where robust encryption is not imperative, the inquiry arises whether alternative cryptographic techniques, which are less costly than encryption, can yield equivalent levels of randomness. This will help computationally weak devices such as IoT sensors. This paper studies both research problems. Initially, we present a methodology inspired by blockchain proof-of-work to securely transmit the key alongside the encrypted message, circumventing the need for a preceding key exchange. Subsequently, we introduce frameworks utilizing cryptographic hash functions and T-functions to supplant symmetric encryption algorithms in counter mode, while also exploring lossless compression as a mechanism for achieving randomness. We outline potential scenarios where either the covert receiver or sender can undertake the proof-of-work to ensure the sender's confidentiality or authenticity. We implement all devised schemes and subject them to rigorous testing using DIEHARD and NIST STS test suites. The results obtained validate the viability of the proposed methodologies.","manuscriptTitle":"Randomization of Message Contents With and Without Encryption for Covert Communication Scenarios","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-30 08:38:27","doi":"10.21203/rs.3.rs-6718778/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-08-30T01:09:37+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-27T03:54:11+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-24T13:08:18+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-18T01:48:49+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"126281177706597373243470616467893302084","date":"2025-08-03T16:37:14+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"81147892143281703129792526006534018519","date":"2025-07-31T01:26:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"77861301180169288553034787431460961095","date":"2025-07-30T00:34:58+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"104362531608383054151859889494572143357","date":"2025-07-29T18:58:11+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"19640938282719334332239459693419162464","date":"2025-07-29T06:38:29+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"91686688468218945916732405478679958086","date":"2025-07-29T03:50:03+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-07-29T01:24:12+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-05-27T18:48:38+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-05-27T18:47:03+00:00","index":"","fulltext":""},{"type":"submitted","content":"International Journal of Information Security","date":"2025-05-21T17:51:24+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-information-security","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ijis","sideBox":"Learn more about [International Journal of Information Security](http://link.springer.com/journal/10207)","snPcode":"10207","submissionUrl":"https://submission.nature.com/new-submission/10207/3","title":"International Journal of Information Security","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"c3d47382-3bf8-4750-9714-100dc4c09953","owner":[],"postedDate":"July 30th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-12-01T16:06:52+00:00","versionOfRecord":{"articleIdentity":"rs-6718778","link":"https://doi.org/10.1007/s10207-025-01160-7","journal":{"identity":"international-journal-of-information-security","isVorOnly":false,"title":"International Journal of Information Security"},"publishedOn":"2025-11-25 15:57:57","publishedOnDateReadable":"November 25th, 2025"},"versionCreatedAt":"2025-07-30 08:38:27","video":"","vorDoi":"10.1007/s10207-025-01160-7","vorDoiUrl":"https://doi.org/10.1007/s10207-025-01160-7","workflowStages":[]},"version":"v1","identity":"rs-6718778","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6718778","identity":"rs-6718778","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}