{"id":"https://openalex.org/W2808596127","doi":"https://doi.org/10.1109/hst.2018.8383892","title":"An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms","display_name":"An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2808596127","doi":"https://doi.org/10.1109/hst.2018.8383892","mag":"2808596127"},"language":"en","primary_location":{"id":"doi:10.1109/hst.2018.8383892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hst.2018.8383892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","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/A5011438358","display_name":"Elena Dubrova","orcid":"https://orcid.org/0000-0001-7382-9408"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Elena Dubrova","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058899830","display_name":"Maxim Teslenko","orcid":null},"institutions":[{"id":"https://openalex.org/I1306339040","display_name":"Ericsson (Sweden)","ror":"https://ror.org/05a7rhx54","country_code":"SE","type":"company","lineage":["https://openalex.org/I1306339040"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Maxim Teslenko","raw_affiliation_strings":["Ericsson Research, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ericsson Research, Sweden","institution_ids":["https://openalex.org/I1306339040"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"65","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9807000160217285,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.8023213148117065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6587222218513489},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6526168584823608},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5426973700523376},{"id":"https://openalex.org/keywords/cryptanalysis","display_name":"Cryptanalysis","score":0.5372486114501953},{"id":"https://openalex.org/keywords/stream-cipher","display_name":"Stream cipher","score":0.4929814338684082},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34175777435302734}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.8023213148117065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6587222218513489},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6526168584823608},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5426973700523376},{"id":"https://openalex.org/C181149355","wikidata":"https://www.wikidata.org/wiki/Q897511","display_name":"Cryptanalysis","level":3,"score":0.5372486114501953},{"id":"https://openalex.org/C92950451","wikidata":"https://www.wikidata.org/wiki/Q864718","display_name":"Stream cipher","level":3,"score":0.4929814338684082},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34175777435302734}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hst.2018.8383892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hst.2018.8383892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W23984549","https://openalex.org/W172560767","https://openalex.org/W763600167","https://openalex.org/W1480210121","https://openalex.org/W1493429498","https://openalex.org/W1493523706","https://openalex.org/W1541566210","https://openalex.org/W1550790359","https://openalex.org/W1578592046","https://openalex.org/W1583771634","https://openalex.org/W1605798759","https://openalex.org/W1968465898","https://openalex.org/W1987179059","https://openalex.org/W2010689735","https://openalex.org/W2012388690","https://openalex.org/W2018659462","https://openalex.org/W2024148935","https://openalex.org/W2026376709","https://openalex.org/W2036265926","https://openalex.org/W2057361103","https://openalex.org/W2060310671","https://openalex.org/W2062897452","https://openalex.org/W2064164319","https://openalex.org/W2074291458","https://openalex.org/W2076397729","https://openalex.org/W2095701698","https://openalex.org/W2099860748","https://openalex.org/W2101428010","https://openalex.org/W2103523108","https://openalex.org/W2106335824","https://openalex.org/W2108020239","https://openalex.org/W2119956173","https://openalex.org/W2128546931","https://openalex.org/W2131719221","https://openalex.org/W2141060521","https://openalex.org/W2142785340","https://openalex.org/W2145198449","https://openalex.org/W2149793686","https://openalex.org/W2153839473","https://openalex.org/W2156335342","https://openalex.org/W2166214692","https://openalex.org/W2211446271","https://openalex.org/W2226303357","https://openalex.org/W2913925549","https://openalex.org/W2951510007","https://openalex.org/W3089447097","https://openalex.org/W4231079874","https://openalex.org/W4241233758","https://openalex.org/W4285719527","https://openalex.org/W4388252848","https://openalex.org/W6622349982","https://openalex.org/W6764250707"],"related_works":["https://openalex.org/W862755557","https://openalex.org/W2162901123","https://openalex.org/W2004360898","https://openalex.org/W2085777029","https://openalex.org/W1446717654","https://openalex.org/W2547991215","https://openalex.org/W2951785426","https://openalex.org/W1518828598","https://openalex.org/W1995085127","https://openalex.org/W1934481693"],"abstract_inverted_index":{"The":[0,55,77,100,108],"absence":[1],"of":[2,21,32,51,75,93,96],"short":[3,23,49,134],"cycles":[4,24,50,65,95,135],"is":[5],"a":[6,41,52,97],"desirable":[7],"property":[8],"for":[9,46,63,103,150],"cryptographic":[10,113],"algorithms":[11,62,79,114],"that":[12,130],"are":[13],"iterated.":[14],"Furthermore,":[15],"as":[16,124],"demonstrated":[17],"by":[18],"the":[19,30,71,91],"cryptanalysis":[20],"A5,":[22],"can":[25,80,111],"be":[26,81],"exploited":[27],"to":[28,70,83,138],"reduce":[29],"complexity":[31],"an":[33,37],"attack.":[34],"We":[35,128],"present":[36],"algorithm":[38,110],"which":[39],"uses":[40],"SAT-based":[42,105],"bounded":[43],"model":[44,106],"checking":[45],"finding":[47,64],"all":[48,94],"given":[53,98],"length.":[54,99],"existing":[56],"Boolean":[57],"Decision":[58],"Diagram":[59],"(BDD)":[60],"based":[61],"have":[66],"limited":[67],"capacity":[68],"due":[69],"excessive":[72],"memory":[73],"requirements":[74],"BDDs.":[76],"simulation-based":[78],"applied":[82],"larger":[84],"problem":[85],"instances,":[86],"however,":[87],"they":[88],"cannot":[89],"guarantee":[90],"detection":[92],"same":[101],"holds":[102],"general-purpose":[104],"checkers.":[107],"presented":[109],"handle":[112],"with":[115],"very":[116],"large":[117],"state":[118],"spaces,":[119],"including":[120],"important":[121],"ciphers":[122,132],"such":[123],"Trivium":[125],"and":[126],"Grain-128.":[127],"found":[129],"these":[131],"contain":[133],"whose":[136],"existence,":[137],"our":[139],"best":[140],"knowledge,":[141],"was":[142],"previously":[143],"unknown.":[144],"This":[145],"potentially":[146],"opens":[147],"new":[148],"possibilities":[149],"cryptanalysis.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}