Noval Image Encryption using Significant Bits of Blocks of Gray Image with New Random Number Generator

Noval Image Encryption using Significant Bits of Blocks of Gray Image with New Random Number Generator | 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 Noval Image Encryption using Significant Bits of Blocks of Gray Image with New Random Number Generator Naghman Ahmad, Muntazim Abbas Hashmi, Umber Rana This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6863768/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 08 Dec, 2025 Read the published version in Discover Computing → Version 1 posted 15 You are reading this latest preprint version Abstract Image encryption is an effective technique for protecting image content. In this paper, we introduce a novel gray image encryption algorithm that integrates PLCM, Random division of blocks, double permutation, Significant Bits manipulation, and the PEF. Initially, the input image is divided into random blocks by PLCM, and the pixels within each block are rearranged using permutation pattern and then put all the blocks back in place and then again apply permutation over the whole image which will give us the permuted image. Secret keys are used to generate random matrix by PEF chaotic map, which produces a random matrix of the same size as the input image. Divide permuted image and random matrix into most significant bit (MSB) and least significant bit (LSB). Finally, the encrypted image is obtained by applying an XOR operation between ( \(\:{MSB}_{P}\oplus\:{LSB}_{R}\:and\:{LSB}_{P}\:\oplus\:{MSB}_{R})\:\) the permuted image and the generated random matrix. The experimental outcome proves the proposed algorithm generates strong encryption and performs better than multiple well-known encryption algorithms. Random division of blocks Double permutation Significant Bits of Blocks and New Random Number Generator Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 08 Dec, 2025 Read the published version in Discover Computing → Version 1 posted Editorial decision: Revision requested 20 Aug, 2025 Reviews received at journal 11 Aug, 2025 Reviewers agreed at journal 08 Aug, 2025 Reviewers agreed at journal 06 Aug, 2025 Reviews received at journal 01 Aug, 2025 Reviews received at journal 31 Jul, 2025 Reviews received at journal 24 Jul, 2025 Reviewers agreed at journal 23 Jul, 2025 Reviewers agreed at journal 22 Jul, 2025 Reviewers agreed at journal 22 Jul, 2025 Reviewers invited by journal 22 Jul, 2025 Editor assigned by journal 03 Jul, 2025 Editor invited by journal 03 Jul, 2025 Submission checks completed at journal 28 Jun, 2025 First submitted to journal 28 Jun, 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-6863768","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":489696543,"identity":"c2c2071d-5b5a-45be-9d4f-6f162d30eefc","order_by":0,"name":"Naghman Ahmad","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABHUlEQVRIiWNgGAWjYHACNjBpAMQSCRU29f0gXkIBsVoenEljnNkA0mJApBbJh22HGTccgHFxAHP249ce3ai5I28udvjhjcS2w8zG51cnfnhgwCDPL3YAqxbLnpxy45xjzwx3zk4ztkg4l85mduPtZgmgwwxnzk7AqsXgQE6adA4b0D23E8wkEsqsecxunN0A0pJgcBuHlvNvgFr+HbbfcDv9m0QCG7OE8Yyzm3/g1XIj/Zh0btvhxA23c4C2tDkbGPD3bsNvy403bNK5fYeTgVqKLRLOpCVI3ODdZpFgIIHbL+fTn0nnfDtsC3TYxps/KmwS+PvPbgYx5PmlsWthYOBBjwIJsEoJHMpBgP0BmgD/ATyqR8EoGAWjYCQCANlda5H93lKBAAAAAElFTkSuQmCC","orcid":"","institution":"Khwaja Fareed University of Engineering and Information Technology (KFUEIT)","correspondingAuthor":true,"prefix":"","firstName":"Naghman","middleName":"","lastName":"Ahmad","suffix":""},{"id":489696545,"identity":"05034a7a-2302-4fc1-9ff4-1f0e5a500435","order_by":1,"name":"Muntazim Abbas Hashmi","email":"","orcid":"","institution":"Khwaja Fareed University of Engineering and Information Technology (KFUEIT)","correspondingAuthor":false,"prefix":"","firstName":"Muntazim","middleName":"Abbas","lastName":"Hashmi","suffix":""},{"id":489696546,"identity":"a74c4dae-061e-4bbe-bdc9-4086bc6ba93e","order_by":2,"name":"Umber Rana","email":"","orcid":"","institution":"Khwaja Fareed University of Engineering and Information Technology (KFUEIT)","correspondingAuthor":false,"prefix":"","firstName":"Umber","middleName":"","lastName":"Rana","suffix":""}],"badges":[],"createdAt":"2025-06-10 13:53:19","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6863768/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6863768/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s10791-025-09844-3","type":"published","date":"2025-12-08T15:58:33+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":98245000,"identity":"4aaed737-8eba-4d3e-a7d2-2c82e3ab016d","added_by":"auto","created_at":"2025-12-15 16:16:15","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1261191,"visible":true,"origin":"","legend":"","description":"","filename":"Naghmanpaperrevision.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6863768/v1_covered_29823894-c49e-4df8-967b-9ed6cd676348.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Noval Image Encryption using Significant Bits of Blocks of Gray Image with New Random Number Generator","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":"discover-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Discover Computing](https://link.springer.com/journal/10791)","snPcode":"10791","submissionUrl":"https://submission.springernature.com/new-submission/10791/3","title":"Discover Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Discover Series","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Random division of blocks, Double permutation, Significant Bits of Blocks and New Random Number Generator","lastPublishedDoi":"10.21203/rs.3.rs-6863768/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6863768/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eImage encryption is an effective technique for protecting image content. In this paper, we introduce a novel gray image encryption algorithm that integrates PLCM, Random division of blocks, double permutation, Significant Bits manipulation, and the PEF. Initially, the input image is divided into random blocks by PLCM, and the pixels within each block are rearranged using permutation pattern and then put all the blocks back in place and then again apply permutation over the whole image which will give us the permuted image. Secret keys are used to generate random matrix by PEF chaotic map, which produces a random matrix of the same size as the input image. Divide permuted image and random matrix into most significant bit (MSB) and least significant bit (LSB). Finally, the encrypted image is obtained by applying an XOR operation between (\u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\(\\:{MSB}_{P}\\oplus\\:{LSB}_{R}\\:and\\:{LSB}_{P}\\:\\oplus\\:{MSB}_{R})\\:\\)\u003c/span\u003e\u003c/span\u003ethe permuted image and the generated random matrix. The experimental outcome proves the proposed algorithm generates strong encryption and performs better than multiple well-known encryption algorithms.\u003c/p\u003e","manuscriptTitle":"Noval Image Encryption using Significant Bits of Blocks of Gray Image with New Random Number Generator","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-24 03:26:20","doi":"10.21203/rs.3.rs-6863768/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-08-20T17:13:43+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-12T02:39:13+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"255166465859417434336637439096652255969","date":"2025-08-08T10:12:53+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"247113225669885818812125299276038268984","date":"2025-08-06T16:18:21+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-01T17:23:28+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-08-01T02:55:12+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-07-25T02:24:53+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"145090820056685152080952727071913248035","date":"2025-07-23T10:41:22+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"339388663876147505119270953425649841975","date":"2025-07-23T00:33:06+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"249611352872480140275996874800920267313","date":"2025-07-22T08:00:58+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-07-22T05:11:47+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-07-03T13:55:25+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2025-07-03T13:36:01+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-06-28T17:45:42+00:00","index":"","fulltext":""},{"type":"submitted","content":"Discover Computing","date":"2025-06-28T17:42:34+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"discover-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Discover Computing](https://link.springer.com/journal/10791)","snPcode":"10791","submissionUrl":"https://submission.springernature.com/new-submission/10791/3","title":"Discover Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Discover Series","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"6938af2a-37e6-4866-a6fe-1a285d9ea6c0","owner":[],"postedDate":"July 24th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2025-12-15T16:11:21+00:00","versionOfRecord":{"articleIdentity":"rs-6863768","link":"https://doi.org/10.1007/s10791-025-09844-3","journal":{"identity":"discover-computing","isVorOnly":false,"title":"Discover Computing"},"publishedOn":"2025-12-08 15:58:33","publishedOnDateReadable":"December 8th, 2025"},"versionCreatedAt":"2025-07-24 03:26:20","video":"","vorDoi":"10.1007/s10791-025-09844-3","vorDoiUrl":"https://doi.org/10.1007/s10791-025-09844-3","workflowStages":[]},"version":"v1","identity":"rs-6863768","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6863768","identity":"rs-6863768","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}