{"id":"https://openalex.org/W4407098361","doi":"https://doi.org/10.23919/isita60732.2024.10858248","title":"Complexity of Solving Hash Puzzles Using Revised Boyer Quantum Algorithm","display_name":"Complexity of Solving Hash Puzzles Using Revised Boyer Quantum Algorithm","publication_year":2024,"publication_date":"2024-11-10","ids":{"openalex":"https://openalex.org/W4407098361","doi":"https://doi.org/10.23919/isita60732.2024.10858248"},"language":"en","primary_location":{"id":"doi:10.23919/isita60732.2024.10858248","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita60732.2024.10858248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"},"type":"article","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/A5031208401","display_name":"C Idota","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Chris Idota","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464-8601"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464-8601","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113863452","display_name":"Yuichi Kaji","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Kaji","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464-8601"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464-8601","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22941884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9725000262260437,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9725000262260437,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9692000150680542,"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.6982213258743286},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6088595986366272},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5073143839836121},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40741121768951416},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.180820494890213}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6982213258743286},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6088595986366272},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5073143839836121},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40741121768951416},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.180820494890213}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita60732.2024.10858248","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita60732.2024.10858248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2051922558","https://openalex.org/W2052129968","https://openalex.org/W2990961515"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W3023219121","https://openalex.org/W2035244949"],"abstract_inverted_index":{"This":[0,85],"study":[1,86],"investigates":[2],"the":[3,55,98,101,104,112,117,124,148],"computational":[4],"complexity":[5,113],"of":[6,50,57,103,107],"solving":[7,116],"hash":[8,14,26,60,83,109,128,140],"puzzles":[9,152],"using":[10],"quantum":[11,39,69,125],"algorithms.":[12,66],"A":[13],"puzzle":[15,110,129,141],"is":[16,35,46,120],"formalized":[17],"as":[18],"a":[19,23,30,47,58,81,108,127,139],"problem":[20],"for":[21,115],"finding":[22],"pre-image":[24],"whose":[25],"value":[27,61],"falls":[28],"within":[29],"specified":[31],"target":[32,105],"set.":[33],"It":[34,119],"known":[36],"that":[37,76],"Grover":[38,51],"search":[40],"algorithm":[41,89],"and":[42,74,94,96,111],"Boyer":[43,88],"algorithm,":[44,52],"which":[45,145],"Bayesian":[48],"utilization":[49],"can":[53,133],"compute":[54],"preimage":[56],"given":[59],"more":[62,143,157],"efficiently":[63],"than":[64,138],"non-quantum":[65],"However,":[67],"those":[68,92],"algorithms":[70],"use":[71],"implicit":[72],"assumptions":[73,93],"approximations":[75],"are":[77,156],"not":[78],"compatible":[79],"with":[80,130,142,153],"general":[82],"puzzle.":[84,118],"revises":[87],"by":[90],"excluding":[91],"approximations,":[95],"clarifies":[97],"relation":[99],"between":[100],"size":[102],"set":[106],"necessary":[114],"shown":[121],"that,":[122],"in":[123],"framework,":[126],"fewer":[131,154],"targets":[132,155],"be":[134],"easier":[135],"to":[136,147,159],"solve":[137],"targets,":[144],"contradicts":[146],"classical":[149],"understanding":[150],"where":[151],"difficult":[158],"solve.":[160]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}