{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:23:24Z","timestamp":1730269404632,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/iolts.2019.8854466","type":"proceedings-article","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:27:48Z","timestamp":1570148868000},"page":"44-47","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient SAT-Attack Algorithm Against Logic Encryption"],"prefix":"10.1109","author":[{"given":"Yusuke","family":"Matsunaga","sequence":"first","affiliation":[]},{"given":"Masayoshi","family":"Yoshimura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2015.7140252"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060492"},{"key":"ref6","article-title":"Lingeling, plingeling and treengeling","author":"biere","year":"2013","journal-title":"Proceedings of the SAT completition"},{"key":"ref5","article-title":"On the complexity of proofs in propositional logics","volume":"2","author":"tseitin","year":"1970","journal-title":"Automation of Reasoning Classical Papers in Computational Logic 1967 – 1970"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2010.24"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228377"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.193"},{"key":"ref9","article-title":"A novel hardware logic encryption technique for thwarting illegal overproduction and hardware trojans","author":"dupuis","year":"2014","journal-title":"11th IEEE International On-Line Testing Symposium"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.284"}],"event":{"name":"2019 IEEE 25th International Symposium on On-Line Testing And Robust System Design (IOLTS)","start":{"date-parts":[[2019,7,1]]},"location":"Rhodes, Greece","end":{"date-parts":[[2019,7,3]]}},"container-title":["2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8846168\/8854369\/08854466.pdf?arnumber=8854466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:50:51Z","timestamp":1658094651000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8854466\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/iolts.2019.8854466","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}