{"id":"https://openalex.org/W3091188114","doi":"https://doi.org/10.1109/iscas45731.2020.9180706","title":"Modeling SAT-Attack Search Complexity","display_name":"Modeling SAT-Attack Search Complexity","publication_year":2020,"publication_date":"2020-09-29","ids":{"openalex":"https://openalex.org/W3091188114","doi":"https://doi.org/10.1109/iscas45731.2020.9180706","mag":"3091188114"},"language":"en","primary_location":{"id":"doi:10.1109/iscas45731.2020.9180706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas45731.2020.9180706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003446575","display_name":"Saran Phatharodom","orcid":"https://orcid.org/0009-0006-4303-7702"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saran Phatharodom","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007957626","display_name":"Nagarajan Kandasamy","orcid":"https://orcid.org/0000-0002-4224-6362"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nagarajan Kandasamy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059641297","display_name":"Ioannis Savidis","orcid":"https://orcid.org/0000-0003-4230-1795"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ioannis Savidis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104","institution_ids":["https://openalex.org/I72816309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I72816309"],"apc_list":null,"apc_paid":null,"fwci":0.4508,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.52338397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14117","display_name":"Integrated Circuits and Semiconductor Failure Analysis","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6510756611824036},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6069662570953369},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5731486082077026},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.5501752495765686},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5414382219314575},{"id":"https://openalex.org/keywords/resilience","display_name":"Resilience (materials science)","score":0.49786806106567383},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.48406901955604553},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4712807536125183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4508768916130066},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43028390407562256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40881139039993286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2888391613960266},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10816076397895813},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09319519996643066}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6510756611824036},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6069662570953369},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5731486082077026},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.5501752495765686},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5414382219314575},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.49786806106567383},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.48406901955604553},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4712807536125183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4508768916130066},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43028390407562256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40881139039993286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2888391613960266},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10816076397895813},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09319519996643066},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas45731.2020.9180706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas45731.2020.9180706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1524250393","https://openalex.org/W1963105592","https://openalex.org/W2012725064","https://openalex.org/W2052353102","https://openalex.org/W2083314129","https://openalex.org/W2124954128","https://openalex.org/W2378876119","https://openalex.org/W2419784917","https://openalex.org/W2615060729","https://openalex.org/W2616325639","https://openalex.org/W2708742051","https://openalex.org/W2741711485","https://openalex.org/W2747980214","https://openalex.org/W2766393343","https://openalex.org/W2790282160","https://openalex.org/W2806992466","https://openalex.org/W2909606757","https://openalex.org/W2943510906","https://openalex.org/W2948964407","https://openalex.org/W2949731107","https://openalex.org/W2956000546","https://openalex.org/W6743403458","https://openalex.org/W6763413223"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2102364390"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,18,22,43,55,72,86,138,163,179,186],"metric":[4],"based":[5,25,34,50,76],"on":[6,35,51,77,178,193],"mathematical":[7],"modeling":[8],"is":[9,48,80,90,125,176],"proposed":[10],"to":[11,42,60,92],"evaluate":[12],"the":[13,30,38,46,61,65,70,95,98,103,110,116,130,135,142,149,169,194,203],"strength":[14],"in":[15,64,97],"security":[16,170],"of":[17,40,69,74,85,109,115,137,141,148,168],"logic-locked":[19],"circuit":[20,160],"against":[21],"satisfiability":[23],"(SAT)":[24],"attack.":[26],"Current":[27],"approaches":[28],"estimate":[29,47,140],"SAT":[31,104],"resilience":[32,75,105,189],"experimentally":[33],"time-to-solve":[36],"or":[37,54,159],"number":[39],"calls":[41],"SAT-solver.":[44],"However,":[45],"often":[49],"one":[52],"sample":[53,57],"small":[56],"size.":[58],"Due":[59],"possible":[62],"variation":[63,96],"search":[66,88,151],"path":[67,99],"length":[68,100],"SAT-attack,":[71],"measure":[73],"statistical":[78],"characterization":[79,147],"proposed.":[81,126],"A":[82],"probabilistic":[83],"model":[84,128],"SAT-attack":[87,157],"process":[89],"developed":[91],"properly":[93],"capture":[94],"and":[101,129,145,190],"report":[102],"as":[106],"an":[107,120,166],"expectation":[108],"computational":[111],"complexity.":[112],"An":[113],"estimator":[114,131],"expected":[117,143],"complexity,":[118],"assuming":[119],"equally":[121],"likely":[122],"branching":[123],"probability,":[124],"The":[127,183],"allow":[132],"for":[133],"1)":[134],"derivation":[136],"closed-form":[139],"security,":[144],"2)":[146],"key":[150,174,197],"space":[152],"without":[153],"experimental":[154],"bias":[155],"toward":[156],"implementation":[158],"topology.":[161],"As":[162],"case":[164],"study,":[165],"analysis":[167],"gain":[171],"per":[172],"inserted":[173],"gate":[175,198],"performed":[177],"full":[180],"adder":[181],"circuit.":[182],"study":[184],"reveals":[185],"monotonically":[187],"increasing":[188],"provides":[191],"insights":[192],"most":[195],"efficient":[196],"placement":[199],"strategy":[200],"that":[201],"maximizes":[202],"achievable":[204],"security.":[205]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}