TestLock: A Testability Logic Locking method against Machine Learning-based Oracle-less attacks | 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 TestLock: A Testability Logic Locking method against Machine Learning-based Oracle-less attacks Marziye Pandi, Mostafa Moghaddas, Hakem Beitollahi This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6371739/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 27 You are reading this latest preprint version Abstract Logic Locking (LL) is a crucial technique for safeguarding Intellectual Property (IP) within the semiconductor supply chain. However, the emergence of sophisticated machine learning-based attacks has posed significant challenges to the security of LL designs. This paper introduces TestLock, a novel LL method that leverages circuit testability metrics to enhance resistance against these advanced threats. By strategically selecting node pairs based on their controllability and observability, TestLock significantly obfuscates the circuit's internal structure, making it considerably more difficult for attackers to identify and exploit vulnerabilities. In the TestLock, we use equivalence class calculations and indistinguishability obfuscation as theoretical proof to formally establish TestLock's resilience, guaranteeing its robustness against machine learning-based attacks. In addition, evaluation against state-of-the-art attacks, including MuxLink and SCOPE, demonstrates TestLock's superior performance in preserving IP integrity. Our results indicate a substantial reduction in attack accuracy, with a 57.13% decrease observed for MuxLink and a 24.22% reduction for SCOPE. TestLock offers a robust and effective defense against these attacks, safeguarding IP from unauthorized access and reverse engineering. Hardware Security Logic Locking IP Protection Machine Learning SCOAP Testability Measures Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 25 Jun, 2025 Reviews received at journal 25 Jun, 2025 Reviews received at journal 25 Jun, 2025 Reviews received at journal 16 Jun, 2025 Reviewers agreed at journal 15 Jun, 2025 Reviewers agreed at journal 14 Jun, 2025 Reviews received at journal 13 Jun, 2025 Reviewers agreed at journal 13 Jun, 2025 Reviewers agreed at journal 12 Jun, 2025 Reviewers agreed at journal 12 Jun, 2025 Reviewers agreed at journal 12 Jun, 2025 Reviewers agreed at journal 11 Jun, 2025 Reviewers agreed at journal 11 Jun, 2025 Reviewers agreed at journal 10 Jun, 2025 Reviewers agreed at journal 10 Jun, 2025 Reviewers agreed at journal 10 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers invited by journal 09 Jun, 2025 Editor assigned by journal 21 Apr, 2025 Submission checks completed at journal 08 Apr, 2025 First submitted to journal 03 Apr, 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-6371739","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":471639196,"identity":"564bf4b9-3e6d-4c37-a48a-16066c630b13","order_by":0,"name":"Marziye Pandi","email":"","orcid":"","institution":"Iran University of Science and Technology","correspondingAuthor":false,"prefix":"","firstName":"Marziye","middleName":"","lastName":"Pandi","suffix":""},{"id":471639197,"identity":"21561a5f-1b28-47a0-be6c-d16b11e648fa","order_by":1,"name":"Mostafa Moghaddas","email":"","orcid":"","institution":"Iran University of Science and Technology","correspondingAuthor":false,"prefix":"","firstName":"Mostafa","middleName":"","lastName":"Moghaddas","suffix":""},{"id":471639198,"identity":"2ffc0618-034a-48f7-9ce8-66eb2987775c","order_by":2,"name":"Hakem Beitollahi","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABKElEQVRIie3QMUvDQBTA8RcC53Kma0q1+QoJB4og+FUuBOKSD+AgNFA4F7VzwQ/h6PjKg7gEsmbIUB3iohAQBBHFixYRmqo4idyfhAcXftxdAEymP5gPrB3YDgvngLz38Q3fni+Inig16ac/JbAg4OMn0tX2WhZel1ANHW+MKA+rDVFQ1jxewNAppYW3y2TnOCaRQC0YYxJlVvOtMo6mJzmIfilhdtZxMNxXgwQoVIz7KBlpwgWsKwjPNSHeQYqboydNRu/khbiY5MJ6VjBaSco4szWRrCWhIu5DImy9i/RXkjoaJH4dKBZLDE+Ju/ou9qZyg2l+lXbepYiD++Sg8rwxzebNA+31JkTWndr1nMuImo4/toDLS65+rRQ6DvZdvyAmk8n073oFJ/xzPtqvA8gAAAAASUVORK5CYII=","orcid":"","institution":"Soran University","correspondingAuthor":true,"prefix":"","firstName":"Hakem","middleName":"","lastName":"Beitollahi","suffix":""}],"badges":[],"createdAt":"2025-04-03 19:38:10","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6371739/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6371739/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":84666706,"identity":"e8b0fd2f-96d2-4ea2-8c12-55b353800cfa","added_by":"auto","created_at":"2025-06-16 05:52:20","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":776122,"visible":true,"origin":"","legend":"","description":"","filename":"snarticletemplate.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6371739/v1_covered_13c6f2ce-1fa4-4176-950c-fd64585d1af4.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"TestLock: A Testability Logic Locking method against Machine Learning-based Oracle-less attacks","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":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Hardware Security, Logic Locking, IP Protection, Machine Learning, SCOAP Testability Measures","lastPublishedDoi":"10.21203/rs.3.rs-6371739/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6371739/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Logic Locking (LL) is a crucial technique for safeguarding Intellectual Property (IP) within the semiconductor supply chain. However, the emergence of sophisticated machine learning-based attacks has posed significant challenges to the security of LL designs. This paper introduces TestLock, a novel LL method that leverages circuit testability metrics to enhance resistance against these advanced threats. By strategically selecting node pairs based on their controllability and observability, TestLock significantly obfuscates the circuit's internal structure, making it considerably more difficult for attackers to identify and exploit vulnerabilities. In the TestLock, we use equivalence class calculations and indistinguishability obfuscation as theoretical proof to formally establish TestLock's resilience, guaranteeing its robustness against machine learning-based attacks. In addition, evaluation against state-of-the-art attacks, including MuxLink and SCOPE, demonstrates TestLock's superior performance in preserving IP integrity. Our results indicate a substantial reduction in attack accuracy, with a 57.13% decrease observed for MuxLink and a 24.22% reduction for SCOPE. TestLock offers a robust and effective defense against these attacks, safeguarding IP from unauthorized access and reverse engineering.","manuscriptTitle":"TestLock: A Testability Logic Locking method against Machine Learning-based Oracle-less attacks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-16 05:44:13","doi":"10.21203/rs.3.rs-6371739/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-06-25T12:24:23+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-25T07:21:49+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-25T04:20:30+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-16T17:11:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"185665248795654332731053062198074896633","date":"2025-06-16T03:26:10+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"179368383499306878445797388290463483989","date":"2025-06-15T00:36:30+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-13T21:25:31+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"103754130168225759527257113985644978206","date":"2025-06-13T05:51:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"173567219422476476556818451478106854771","date":"2025-06-12T12:49:43+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"185823557665536170400167137646056043282","date":"2025-06-12T09:11:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"313381400443367143318446534826760872647","date":"2025-06-12T08:10:39+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"66180511548909960841478270353044598394","date":"2025-06-12T02:59:04+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"290160404826531813076014852001769402871","date":"2025-06-11T16:24:03+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"146131802284124589793442599097265578747","date":"2025-06-10T16:29:23+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"60839117574727239128584202095446688663","date":"2025-06-10T12:15:43+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"300811860938200742481739911488934687506","date":"2025-06-10T11:30:05+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"177808195063267829306407082505967417467","date":"2025-06-10T03:07:09+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"251656960412785113859673248968719797554","date":"2025-06-10T02:59:48+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"4746524158931660273957719486687428495","date":"2025-06-10T02:36:43+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"262903818765792506234845571015006235718","date":"2025-06-10T01:21:19+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"51539603394895890149152720861473834082","date":"2025-06-10T01:07:54+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"246459072170936341431262731659148282575","date":"2025-06-09T23:07:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"53807386981687162285597340631458579695","date":"2025-06-09T23:01:11+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-09T22:55:59+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-04-22T01:53:36+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-04-08T13:12:45+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2025-04-03T19:32:04+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"445b75bc-fe70-42e6-b8b4-cd7d8a8252c9","owner":[],"postedDate":"June 16th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2025-08-26T21:08:20+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-16 05:44:13","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6371739","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6371739","identity":"rs-6371739","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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.