A Lightweight Hardware Encryption System Featuring an Efficient Tower Field S-Box Scheme

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated deep summary by claude@2026-06, 2026-06-24 · read from full text

This paper studies how to design an efficient, secure S-box for lightweight hardware encryption, using a compact combinational logic architecture combined with a tower field masking-based scheme in an SM4 implementation. The authors propose a transformation matrix expansion mechanism solved via a k-node bundled search with a maximum depth constraint, a sub-module series connection approach with backtracking judgment to reduce circuit depth, and a tower field masking reuse method based on correction term computation to enhance security. They report reduced circuit area and lower logic depth, along with lower resource utilization and energy consumption and strong resistance against side-channel attacks, while noting the work is a preprint that has not been peer reviewed. This paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract Lightweight encryption algorithms provide effective protection for data security in resource-constrained hardware devices. The S-box plays a crucial role in the lightweight implementation of the encryption algorithm. However, balancing area, delay, and security in the implementation of the S-box remains a challenging task. In this paper, we propose an efficient S-box design that integrates a compact combinational logic architecture with a tower field masking-based secure scheme. First, we propose a transformation matrix expansion mechanism for the S-box; then, we present a $k$-node bundled search strategy with a maximum depth constraint to solve the expansion matrix. Second, we propose a sub-module series connection method, which utilizes a backtracking judgment mechanism to reduce circuit depth. Third, we propose a tower field masking reuse scheme based on correction term computation to enhance security. Finally, we present the SM4 algorithm implementation and encryption system evaluation. Our design optimizes and balances both compact and secure, the design achieves a reduced circuit area and a lower logic depth. Furthermore, the encryption system demonstrates lower resource utilization, decreased energy consumption, and strong resistance against side-channel attacks.
Full text 11,971 characters · extracted from preprint-html · click to expand
A Lightweight Hardware Encryption System Featuring an Efficient Tower Field S-Box Scheme | 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 A Lightweight Hardware Encryption System Featuring an Efficient Tower Field S-Box Scheme Xin Chen, Ying Liu, Xiang Zhao, Zhikang Qin This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8634335/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 8 You are reading this latest preprint version Abstract Lightweight encryption algorithms provide effective protection for data security in resource-constrained hardware devices. The S-box plays a crucial role in the lightweight implementation of the encryption algorithm. However, balancing area, delay, and security in the implementation of the S-box remains a challenging task. In this paper, we propose an efficient S-box design that integrates a compact combinational logic architecture with a tower field masking-based secure scheme. First, we propose a transformation matrix expansion mechanism for the S-box; then, we present a $k$-node bundled search strategy with a maximum depth constraint to solve the expansion matrix. Second, we propose a sub-module series connection method, which utilizes a backtracking judgment mechanism to reduce circuit depth. Third, we propose a tower field masking reuse scheme based on correction term computation to enhance security. Finally, we present the SM4 algorithm implementation and encryption system evaluation. Our design optimizes and balances both compact and secure, the design achieves a reduced circuit area and a lower logic depth. Furthermore, the encryption system demonstrates lower resource utilization, decreased energy consumption, and strong resistance against side-channel attacks. SM4 S-box tower field logic minimization mask reuse Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 24 Mar, 2026 Reviewers agreed at journal 02 Mar, 2026 Reviews received at journal 26 Feb, 2026 Reviewers agreed at journal 26 Feb, 2026 Reviewers invited by journal 25 Feb, 2026 Editor assigned by journal 20 Jan, 2026 Submission checks completed at journal 20 Jan, 2026 First submitted to journal 18 Jan, 2026 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-8634335","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":597568310,"identity":"55424f2c-e5b0-42b5-b547-2f310ce6ad6a","order_by":0,"name":"Xin Chen","email":"","orcid":"","institution":"Beijing Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Xin","middleName":"","lastName":"Chen","suffix":""},{"id":597568311,"identity":"a3e3e266-ccf3-4500-bd88-fbf63f058293","order_by":1,"name":"Ying Liu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAtUlEQVRIiWNgGAWjYDACdsYGho8NbGC2BHFamBkbGGc2sEmQogWIeBsYSNBicJi5Tdp2B1+dwQHmg7d5GOzyiNDC2Cade4ZNwuAAW7I1D0NyMZFa2kBaeMykeRgOJDYQpcUSrIX/GwlaGCG2sBGnRfIwY7Nl7xk2yZmH2Ywt5xgkE9bCd7z94Y2fO47x8x1vfnjjTYUdYS0KB8DUMXAEAd1JSD0QyEMMrSFC6SgYBaNgFIxYAABtRzZVGDsVTwAAAABJRU5ErkJggg==","orcid":"","institution":"Beijing Jiaotong University","correspondingAuthor":true,"prefix":"","firstName":"Ying","middleName":"","lastName":"Liu","suffix":""},{"id":597568312,"identity":"bcd8bf32-92cf-42d5-971f-6f9433520d75","order_by":2,"name":"Xiang Zhao","email":"","orcid":"","institution":"Beijing Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Xiang","middleName":"","lastName":"Zhao","suffix":""},{"id":597568313,"identity":"05bd0067-4c46-41a9-8b1b-7508b4d2111a","order_by":3,"name":"Zhikang Qin","email":"","orcid":"","institution":"Beijing Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Zhikang","middleName":"","lastName":"Qin","suffix":""}],"badges":[],"createdAt":"2026-01-19 02:38:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8634335/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8634335/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":103712385,"identity":"f80bcc6b-9fb5-4495-9f6d-7421343aebc3","added_by":"auto","created_at":"2026-03-02 04:10:55","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1412458,"visible":true,"origin":"","legend":"","description":"","filename":"manuscriptJCEN.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8634335/v1_covered_df2a6d42-fa5b-4a3c-92a3-65809c48b865.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Lightweight Hardware Encryption System Featuring an Efficient Tower Field S-Box Scheme","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"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":"journal-of-cryptographic-engineering","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jcen","sideBox":"Learn more about [Journal of Cryptographic Engineering](http://link.springer.com/journal/13389)","snPcode":"13389","submissionUrl":"https://submission.nature.com/new-submission/13389/3","title":"Journal of Cryptographic Engineering","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"SM4, S-box, tower field, logic minimization, mask reuse","lastPublishedDoi":"10.21203/rs.3.rs-8634335/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8634335/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Lightweight encryption algorithms provide effective protection for data security in resource-constrained hardware devices. The S-box plays a crucial role in the lightweight implementation of the encryption algorithm. However, balancing area, delay, and security in the implementation of the S-box remains a challenging task. \nIn this paper, we propose an efficient S-box design that integrates a compact combinational logic architecture with a tower field masking-based secure scheme. \nFirst, we propose a transformation matrix expansion mechanism for the S-box; then, we present a $k$-node bundled search strategy with a maximum depth constraint to solve the expansion matrix. Second, we propose a sub-module series connection method, which utilizes a backtracking judgment mechanism to reduce circuit depth. Third, we propose a tower field masking reuse scheme based on correction term computation to enhance security.\nFinally, we present the SM4 algorithm implementation and encryption system evaluation. Our design optimizes and balances both compact and secure, the design achieves a reduced circuit area and a lower logic depth. Furthermore, the encryption system demonstrates lower resource utilization, decreased energy consumption, and strong resistance against side-channel attacks.","manuscriptTitle":"A Lightweight Hardware Encryption System Featuring an Efficient Tower Field S-Box Scheme","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-03-02 04:10:46","doi":"10.21203/rs.3.rs-8634335/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-03-24T14:30:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"310683846753860582142746730297953473137","date":"2026-03-02T09:26:21+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-02-26T13:17:08+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"258680806022310125501690142719250459936","date":"2026-02-26T09:43:01+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-25T17:17:36+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-01-20T10:57:39+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-01-20T10:55:40+00:00","index":"","fulltext":""},{"type":"submitted","content":"Journal of Cryptographic Engineering","date":"2026-01-19T02:25:36+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"journal-of-cryptographic-engineering","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jcen","sideBox":"Learn more about [Journal of Cryptographic Engineering](http://link.springer.com/journal/13389)","snPcode":"13389","submissionUrl":"https://submission.nature.com/new-submission/13389/3","title":"Journal of Cryptographic Engineering","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"25b4e508-7073-4eec-956f-4c6c34e1bc6b","owner":[],"postedDate":"March 2nd, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-03-02T04:10:46+00:00","versionOfRecord":[],"versionCreatedAt":"2026-03-02 04:10:46","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8634335","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8634335","identity":"rs-8634335","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-27T02:00:06.600101+00:00
License: CC-BY-4.0