Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.12690 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913477177638912 |
|---|---|
| author | Hu, Yinghua Cherupalli, Hari Borza, Mike Sherlekar, Deepak |
| author_facet | Hu, Yinghua Cherupalli, Hari Borza, Mike Sherlekar, Deepak |
| contents | The evaluation of logic locking methods has long been predicated on an implicit assumption that only the correct key can unveil the true functionality of a protected circuit. Consequently, a locking technique is deemed secure if it resists a good array of attacks aimed at finding this correct key. This paper challenges this one-key premise by introducing a more efficient attack methodology, focused not on identifying that one correct key, but on finding multiple, potentially incorrect keys that can collectively produce correct functionality from the protected circuit. The tasks of finding these keys can be parallelized, which is well suited for multi-core computing environments. Empirical results show our attack achieves a runtime reduction of up to 99.6% compared to the conventional attack that tries to find a single correct key. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_12690 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Late Breaking Results: On the One-Key Premise of Logic Locking Hu, Yinghua Cherupalli, Hari Borza, Mike Sherlekar, Deepak Cryptography and Security Systems and Control The evaluation of logic locking methods has long been predicated on an implicit assumption that only the correct key can unveil the true functionality of a protected circuit. Consequently, a locking technique is deemed secure if it resists a good array of attacks aimed at finding this correct key. This paper challenges this one-key premise by introducing a more efficient attack methodology, focused not on identifying that one correct key, but on finding multiple, potentially incorrect keys that can collectively produce correct functionality from the protected circuit. The tasks of finding these keys can be parallelized, which is well suited for multi-core computing environments. Empirical results show our attack achieves a runtime reduction of up to 99.6% compared to the conventional attack that tries to find a single correct key. |
| title | Late Breaking Results: On the One-Key Premise of Logic Locking |
| topic | Cryptography and Security Systems and Control |
| url | https://arxiv.org/abs/2408.12690 |