Unraveling Latch Locking Using Machine Learning, Boolean Analysis, and ILP Article Swipe
Dake Chen
,
Xuan Zhou
,
Yinghua Hu
,
Yuke Zhang
,
Kaixin Yang
,
Andrew Rittenbach
,
Pierluigi Nuzzo
,
Peter A. Beerel
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2305.00107
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2305.00107
Logic locking has become a promising approach to provide hardware security in the face of a possibly insecure fabrication supply chain. While many techniques have focused on locking combinational logic (CL), an alternative latch-locking approach in which the sequential elements are locked has also gained significant attention. Latch (LAT) locking duplicates a subset of the flip-flops (FF) of a design, retimes these FFs and replaces them with latches, and adds two types of decoy latches to obfuscate the netlist. It then adds control circuitry (CC) such that all latches must be correctly keyed for the circuit to function correctly. This paper presents a two-phase attack on latch-locked circuits that uses a novel combination of deep learning, Boolean analysis, and integer linear programming (ILP). The attack requires access to the reverse-engineered netlist but, unlike SAT attacks, is oracle-less, not needing access to the unlocked circuit or correct input/output pairs. We trained and evaluated the attack using the ISCAS'89 and ITC'99 benchmark circuits. The attack successfully identifies a key that is, on average, 96.9% accurate and fully discloses the correct functionality in 8 of the tested 19 circuits and leads to low function corruptibility (less than 4%) in 3 additional circuits. The attack run-times are manageable.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2305.00107
- https://arxiv.org/pdf/2305.00107
- OA Status
- green
- Cited By
- 1
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4367692372
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4367692372Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2305.00107Digital Object Identifier
- Title
-
Unraveling Latch Locking Using Machine Learning, Boolean Analysis, and ILPWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-04-28Full publication date if available
- Authors
-
Dake Chen, Xuan Zhou, Yinghua Hu, Yuke Zhang, Kaixin Yang, Andrew Rittenbach, Pierluigi Nuzzo, Peter A. BeerelList of authors in order
- Landing page
-
https://arxiv.org/abs/2305.00107Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2305.00107Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2305.00107Direct OA link when available
- Concepts
-
Netlist, Computer science, Sequential logic, Boolean function, Arbiter, Electronic circuit, Benchmark (surveying), Algorithm, Computer hardware, Logic gate, Engineering, Electrical engineering, Geodesy, GeographyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1Per-year citation counts (last 5 years)
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4367692372 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2305.00107 |
| ids.doi | https://doi.org/10.48550/arxiv.2305.00107 |
| ids.openalex | https://openalex.org/W4367692372 |
| fwci | |
| type | preprint |
| title | Unraveling Latch Locking Using Machine Learning, Boolean Analysis, and ILP |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12122 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1708 |
| topics[0].subfield.display_name | Hardware and Architecture |
| topics[0].display_name | Physical Unclonable Functions (PUFs) and Hardware Security |
| topics[1].id | https://openalex.org/T10558 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9986000061035156 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | Advancements in Semiconductor Devices and Circuit Design |
| topics[2].id | https://openalex.org/T10472 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9977999925613403 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2208 |
| topics[2].subfield.display_name | Electrical and Electronic Engineering |
| topics[2].display_name | Semiconductor materials and devices |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C177650935 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8788926005363464 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1760303 |
| concepts[0].display_name | Netlist |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.684156060218811 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C187075797 |
| concepts[2].level | 3 |
| concepts[2].score | 0.5682068467140198 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q173245 |
| concepts[2].display_name | Sequential logic |
| concepts[3].id | https://openalex.org/C187455244 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5421070456504822 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q942353 |
| concepts[3].display_name | Boolean function |
| concepts[4].id | https://openalex.org/C2779971761 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5257523655891418 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q629872 |
| concepts[4].display_name | Arbiter |
| concepts[5].id | https://openalex.org/C134146338 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4765104353427887 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1815901 |
| concepts[5].display_name | Electronic circuit |
| concepts[6].id | https://openalex.org/C185798385 |
| concepts[6].level | 2 |
| concepts[6].score | 0.45988544821739197 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1161707 |
| concepts[6].display_name | Benchmark (surveying) |
| concepts[7].id | https://openalex.org/C11413529 |
| concepts[7].level | 1 |
| concepts[7].score | 0.3689950704574585 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[7].display_name | Algorithm |
| concepts[8].id | https://openalex.org/C9390403 |
| concepts[8].level | 1 |
| concepts[8].score | 0.31612342596054077 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q3966 |
| concepts[8].display_name | Computer hardware |
| concepts[9].id | https://openalex.org/C131017901 |
| concepts[9].level | 2 |
| concepts[9].score | 0.31401482224464417 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q170451 |
| concepts[9].display_name | Logic gate |
| concepts[10].id | https://openalex.org/C127413603 |
| concepts[10].level | 0 |
| concepts[10].score | 0.1475599706172943 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[10].display_name | Engineering |
| concepts[11].id | https://openalex.org/C119599485 |
| concepts[11].level | 1 |
| concepts[11].score | 0.11314195394515991 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q43035 |
| concepts[11].display_name | Electrical engineering |
| concepts[12].id | https://openalex.org/C13280743 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q131089 |
| concepts[12].display_name | Geodesy |
| concepts[13].id | https://openalex.org/C205649164 |
| concepts[13].level | 0 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1071 |
| concepts[13].display_name | Geography |
| keywords[0].id | https://openalex.org/keywords/netlist |
| keywords[0].score | 0.8788926005363464 |
| keywords[0].display_name | Netlist |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.684156060218811 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/sequential-logic |
| keywords[2].score | 0.5682068467140198 |
| keywords[2].display_name | Sequential logic |
| keywords[3].id | https://openalex.org/keywords/boolean-function |
| keywords[3].score | 0.5421070456504822 |
| keywords[3].display_name | Boolean function |
| keywords[4].id | https://openalex.org/keywords/arbiter |
| keywords[4].score | 0.5257523655891418 |
| keywords[4].display_name | Arbiter |
| keywords[5].id | https://openalex.org/keywords/electronic-circuit |
| keywords[5].score | 0.4765104353427887 |
| keywords[5].display_name | Electronic circuit |
| keywords[6].id | https://openalex.org/keywords/benchmark |
| keywords[6].score | 0.45988544821739197 |
| keywords[6].display_name | Benchmark (surveying) |
| keywords[7].id | https://openalex.org/keywords/algorithm |
| keywords[7].score | 0.3689950704574585 |
| keywords[7].display_name | Algorithm |
| keywords[8].id | https://openalex.org/keywords/computer-hardware |
| keywords[8].score | 0.31612342596054077 |
| keywords[8].display_name | Computer hardware |
| keywords[9].id | https://openalex.org/keywords/logic-gate |
| keywords[9].score | 0.31401482224464417 |
| keywords[9].display_name | Logic gate |
| keywords[10].id | https://openalex.org/keywords/engineering |
| keywords[10].score | 0.1475599706172943 |
| keywords[10].display_name | Engineering |
| keywords[11].id | https://openalex.org/keywords/electrical-engineering |
| keywords[11].score | 0.11314195394515991 |
| keywords[11].display_name | Electrical engineering |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2305.00107 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://arxiv.org/pdf/2305.00107 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2305.00107 |
| locations[1].id | doi:10.48550/arxiv.2305.00107 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2305.00107 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5022810915 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-8193-7158 |
| authorships[0].author.display_name | Dake Chen |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Chen, Dake |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5100715699 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-6412-7655 |
| authorships[1].author.display_name | Xuan Zhou |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Zhou, Xuan |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5047763395 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-3863-1196 |
| authorships[2].author.display_name | Yinghua Hu |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Hu, Yinghua |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5019021341 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-5253-5478 |
| authorships[3].author.display_name | Yuke Zhang |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Zhang, Yuke |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5113173970 |
| authorships[4].author.orcid | https://orcid.org/0009-0008-5234-2316 |
| authorships[4].author.display_name | Kaixin Yang |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Yang, Kaixin |
| authorships[4].is_corresponding | False |
| authorships[5].author.id | https://openalex.org/A5073069762 |
| authorships[5].author.orcid | |
| authorships[5].author.display_name | Andrew Rittenbach |
| authorships[5].author_position | middle |
| authorships[5].raw_author_name | Rittenbach, Andrew |
| authorships[5].is_corresponding | False |
| authorships[6].author.id | https://openalex.org/A5067636168 |
| authorships[6].author.orcid | https://orcid.org/0000-0003-2984-0364 |
| authorships[6].author.display_name | Pierluigi Nuzzo |
| authorships[6].author_position | middle |
| authorships[6].raw_author_name | Nuzzo, Pierluigi |
| authorships[6].is_corresponding | False |
| authorships[7].author.id | https://openalex.org/A5084205024 |
| authorships[7].author.orcid | https://orcid.org/0000-0002-8283-0168 |
| authorships[7].author.display_name | Peter A. Beerel |
| authorships[7].author_position | last |
| authorships[7].raw_author_name | Beerel, Peter A. |
| authorships[7].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2305.00107 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2023-05-03T00:00:00 |
| display_name | Unraveling Latch Locking Using Machine Learning, Boolean Analysis, and ILP |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T12122 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1708 |
| primary_topic.subfield.display_name | Hardware and Architecture |
| primary_topic.display_name | Physical Unclonable Functions (PUFs) and Hardware Security |
| related_works | https://openalex.org/W2886316835, https://openalex.org/W4245491991, https://openalex.org/W2805856399, https://openalex.org/W4293023571, https://openalex.org/W2365516097, https://openalex.org/W4237333073, https://openalex.org/W1567508215, https://openalex.org/W2746929098, https://openalex.org/W4296473373, https://openalex.org/W2542280163 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2305.00107 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2305.00107 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2305.00107 |
| primary_location.id | pmh:oai:arXiv.org:2305.00107 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://arxiv.org/pdf/2305.00107 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2305.00107 |
| publication_date | 2023-04-28 |
| publication_year | 2023 |
| referenced_works_count | 0 |
| abstract_inverted_index.3 | 196 |
| abstract_inverted_index.8 | 180 |
| abstract_inverted_index.a | 4, 15, 51, 58, 102, 110, 165 |
| abstract_inverted_index.19 | 184 |
| abstract_inverted_index.It | 79 |
| abstract_inverted_index.We | 148 |
| abstract_inverted_index.an | 31 |
| abstract_inverted_index.be | 90 |
| abstract_inverted_index.in | 11, 35, 179, 195 |
| abstract_inverted_index.is | 135 |
| abstract_inverted_index.of | 14, 53, 57, 72, 113, 181 |
| abstract_inverted_index.on | 26, 105, 169 |
| abstract_inverted_index.or | 144 |
| abstract_inverted_index.to | 7, 75, 96, 127, 140, 188 |
| abstract_inverted_index.4%) | 194 |
| abstract_inverted_index.FFs | 62 |
| abstract_inverted_index.SAT | 133 |
| abstract_inverted_index.The | 123, 161, 199 |
| abstract_inverted_index.all | 87 |
| abstract_inverted_index.and | 63, 68, 118, 150, 157, 173, 186 |
| abstract_inverted_index.are | 40, 202 |
| abstract_inverted_index.for | 93 |
| abstract_inverted_index.has | 2, 42 |
| abstract_inverted_index.is, | 168 |
| abstract_inverted_index.key | 166 |
| abstract_inverted_index.low | 189 |
| abstract_inverted_index.not | 137 |
| abstract_inverted_index.the | 12, 37, 54, 77, 94, 128, 141, 152, 155, 176, 182 |
| abstract_inverted_index.two | 70 |
| abstract_inverted_index.(CC) | 84 |
| abstract_inverted_index.(FF) | 56 |
| abstract_inverted_index.This | 99 |
| abstract_inverted_index.adds | 69, 81 |
| abstract_inverted_index.also | 43 |
| abstract_inverted_index.but, | 131 |
| abstract_inverted_index.deep | 114 |
| abstract_inverted_index.face | 13 |
| abstract_inverted_index.have | 24 |
| abstract_inverted_index.many | 22 |
| abstract_inverted_index.must | 89 |
| abstract_inverted_index.such | 85 |
| abstract_inverted_index.than | 193 |
| abstract_inverted_index.that | 86, 108, 167 |
| abstract_inverted_index.them | 65 |
| abstract_inverted_index.then | 80 |
| abstract_inverted_index.uses | 109 |
| abstract_inverted_index.with | 66 |
| abstract_inverted_index.(CL), | 30 |
| abstract_inverted_index.(LAT) | 48 |
| abstract_inverted_index.(less | 192 |
| abstract_inverted_index.96.9% | 171 |
| abstract_inverted_index.Latch | 47 |
| abstract_inverted_index.Logic | 0 |
| abstract_inverted_index.While | 21 |
| abstract_inverted_index.decoy | 73 |
| abstract_inverted_index.fully | 174 |
| abstract_inverted_index.keyed | 92 |
| abstract_inverted_index.leads | 187 |
| abstract_inverted_index.logic | 29 |
| abstract_inverted_index.novel | 111 |
| abstract_inverted_index.paper | 100 |
| abstract_inverted_index.these | 61 |
| abstract_inverted_index.types | 71 |
| abstract_inverted_index.using | 154 |
| abstract_inverted_index.which | 36 |
| abstract_inverted_index.(ILP). | 122 |
| abstract_inverted_index.ITC'99 | 158 |
| abstract_inverted_index.access | 126, 139 |
| abstract_inverted_index.attack | 104, 124, 153, 162, 200 |
| abstract_inverted_index.become | 3 |
| abstract_inverted_index.chain. | 20 |
| abstract_inverted_index.gained | 44 |
| abstract_inverted_index.linear | 120 |
| abstract_inverted_index.locked | 41 |
| abstract_inverted_index.pairs. | 147 |
| abstract_inverted_index.subset | 52 |
| abstract_inverted_index.supply | 19 |
| abstract_inverted_index.tested | 183 |
| abstract_inverted_index.unlike | 132 |
| abstract_inverted_index.Boolean | 116 |
| abstract_inverted_index.circuit | 95, 143 |
| abstract_inverted_index.control | 82 |
| abstract_inverted_index.correct | 145, 177 |
| abstract_inverted_index.design, | 59 |
| abstract_inverted_index.focused | 25 |
| abstract_inverted_index.integer | 119 |
| abstract_inverted_index.latches | 74, 88 |
| abstract_inverted_index.locking | 1, 27, 49 |
| abstract_inverted_index.needing | 138 |
| abstract_inverted_index.netlist | 130 |
| abstract_inverted_index.provide | 8 |
| abstract_inverted_index.retimes | 60 |
| abstract_inverted_index.trained | 149 |
| abstract_inverted_index.ISCAS'89 | 156 |
| abstract_inverted_index.accurate | 172 |
| abstract_inverted_index.approach | 6, 34 |
| abstract_inverted_index.attacks, | 134 |
| abstract_inverted_index.average, | 170 |
| abstract_inverted_index.circuits | 107, 185 |
| abstract_inverted_index.elements | 39 |
| abstract_inverted_index.function | 97, 190 |
| abstract_inverted_index.hardware | 9 |
| abstract_inverted_index.insecure | 17 |
| abstract_inverted_index.latches, | 67 |
| abstract_inverted_index.netlist. | 78 |
| abstract_inverted_index.possibly | 16 |
| abstract_inverted_index.presents | 101 |
| abstract_inverted_index.replaces | 64 |
| abstract_inverted_index.requires | 125 |
| abstract_inverted_index.security | 10 |
| abstract_inverted_index.unlocked | 142 |
| abstract_inverted_index.analysis, | 117 |
| abstract_inverted_index.benchmark | 159 |
| abstract_inverted_index.circuitry | 83 |
| abstract_inverted_index.circuits. | 160, 198 |
| abstract_inverted_index.correctly | 91 |
| abstract_inverted_index.discloses | 175 |
| abstract_inverted_index.evaluated | 151 |
| abstract_inverted_index.learning, | 115 |
| abstract_inverted_index.obfuscate | 76 |
| abstract_inverted_index.promising | 5 |
| abstract_inverted_index.run-times | 201 |
| abstract_inverted_index.two-phase | 103 |
| abstract_inverted_index.additional | 197 |
| abstract_inverted_index.attention. | 46 |
| abstract_inverted_index.correctly. | 98 |
| abstract_inverted_index.duplicates | 50 |
| abstract_inverted_index.flip-flops | 55 |
| abstract_inverted_index.identifies | 164 |
| abstract_inverted_index.sequential | 38 |
| abstract_inverted_index.techniques | 23 |
| abstract_inverted_index.alternative | 32 |
| abstract_inverted_index.combination | 112 |
| abstract_inverted_index.fabrication | 18 |
| abstract_inverted_index.manageable. | 203 |
| abstract_inverted_index.programming | 121 |
| abstract_inverted_index.significant | 45 |
| abstract_inverted_index.input/output | 146 |
| abstract_inverted_index.latch-locked | 106 |
| abstract_inverted_index.oracle-less, | 136 |
| abstract_inverted_index.successfully | 163 |
| abstract_inverted_index.combinational | 28 |
| abstract_inverted_index.functionality | 178 |
| abstract_inverted_index.latch-locking | 33 |
| abstract_inverted_index.corruptibility | 191 |
| abstract_inverted_index.reverse-engineered | 129 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 8 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.4300000071525574 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile |