{"id":"https://openalex.org/W4406261619","doi":"https://doi.org/10.1109/qce60285.2024.00155","title":"Foldable, Recursive Proofs of Isogeny Computation with Reduced Time Complexity","display_name":"Foldable, Recursive Proofs of Isogeny Computation with Reduced Time Complexity","publication_year":2024,"publication_date":"2024-09-15","ids":{"openalex":"https://openalex.org/W4406261619","doi":"https://doi.org/10.1109/qce60285.2024.00155"},"language":"en","primary_location":{"id":"doi:10.1109/qce60285.2024.00155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce60285.2024.00155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Quantum Computing and Engineering (QCE)","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/A5018317100","display_name":"Krystal Maughan","orcid":null},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Krystal Maughan","raw_affiliation_strings":["College of Engineering and Mathematical Sciences, University of Vermont,Burlington,United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Engineering and Mathematical Sciences, University of Vermont,Burlington,United States of America","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061707651","display_name":"Joseph P. Near","orcid":"https://orcid.org/0000-0002-3203-3742"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph P. Near","raw_affiliation_strings":["College of Engineering and Mathematical Sciences, University of Vermont,Burlington,United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Engineering and Mathematical Sciences, University of Vermont,Burlington,United States of America","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014425101","display_name":"Christelle Vincent","orcid":"https://orcid.org/0000-0003-3701-7933"},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christelle Vincent","raw_affiliation_strings":["College of Engineering and Mathematical Sciences, University of Vermont,Burlington,United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Engineering and Mathematical Sciences, University of Vermont,Burlington,United States of America","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111236770"],"apc_list":null,"apc_paid":null,"fwci":0.3126,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65725177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1304","last_page":"1308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9894000291824341,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9894000291824341,"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/T11567","display_name":"semigroups and automata theory","score":0.9883000254631042,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9854000210762024,"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/isogeny","display_name":"Isogeny","score":0.9535313248634338},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7237995266914368},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5872588157653809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5434517860412598},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4571852385997772},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44658803939819336},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40828046202659607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35153257846832275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3425021767616272},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11899396777153015},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.07889991998672485}],"concepts":[{"id":"https://openalex.org/C2779765290","wikidata":"https://www.wikidata.org/wiki/Q1674414","display_name":"Isogeny","level":3,"score":0.9535313248634338},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7237995266914368},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5872588157653809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5434517860412598},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4571852385997772},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44658803939819336},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40828046202659607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35153257846832275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3425021767616272},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11899396777153015},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.07889991998672485},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce60285.2024.00155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce60285.2024.00155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Quantum Computing and Engineering (QCE)","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":26,"referenced_works":["https://openalex.org/W1589034595","https://openalex.org/W1987475429","https://openalex.org/W1991771574","https://openalex.org/W1999502904","https://openalex.org/W2000932900","https://openalex.org/W2592544948","https://openalex.org/W2791851483","https://openalex.org/W2952978074","https://openalex.org/W2990498574","https://openalex.org/W3082533815","https://openalex.org/W3088050895","https://openalex.org/W3111514642","https://openalex.org/W3158989923","https://openalex.org/W3215829107","https://openalex.org/W4254894701","https://openalex.org/W4313270705","https://openalex.org/W4320154950","https://openalex.org/W4323921570","https://openalex.org/W4362476330","https://openalex.org/W4365810595","https://openalex.org/W4365934498","https://openalex.org/W4391916560","https://openalex.org/W4399015500","https://openalex.org/W6802122047","https://openalex.org/W6802722816","https://openalex.org/W6874314319"],"related_works":["https://openalex.org/W3097454540","https://openalex.org/W2949868757","https://openalex.org/W3165502361","https://openalex.org/W4302370234","https://openalex.org/W2951061117","https://openalex.org/W3137547215","https://openalex.org/W2069055256","https://openalex.org/W2957732868","https://openalex.org/W2918104289","https://openalex.org/W2150775827"],"abstract_inverted_index":{"The":[0],"security":[1],"of":[2,42,55,67,70,94,105,115,125,129,134,169,172],"certain":[3],"post-quantum":[4],"isogeny-based":[5],"cryptographic":[6],"schemes":[7],"relies":[8],"on":[9],"the":[10,26,45,65,68,92,95,98,116,123,157,166],"ability":[11],"to":[12,90,143,174],"provably":[13],"and":[14,32,47],"efficiently":[15],"compute":[16],"isogenies":[17,59,138],"between":[18],"supersingular":[19],"elliptic":[20],"curves":[21],"without":[22],"leaking":[23],"information":[24],"about":[25],"isogeny":[27,99,127],"other":[28],"than":[29,101],"its":[30],"domain":[31],"codomain.":[33],"Earlier":[34],"work":[35],"in":[36,78],"this":[37,83,164,170,175],"direction":[38],"give":[39],"mathematical":[40],"proofs":[41],"knowledge":[43],"for":[44,131],"isogeny,":[46],"as":[48,113],"a":[49,53,88,103,132,152],"result":[50],"when":[51],"computing":[52,97],"chain":[54,133],"<tex":[56,79,135,140,144],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[57,80,136,141,145],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[58,137],"each":[60,71,150],"proceeding":[61],"node":[62],"must":[63],"verify":[64],"correctness":[66],"proof":[69,104,108,128,154],"preceding":[72,159],"node,":[73],"which":[74,121],"is":[75,165],"computationally":[76],"linear":[77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>.":[81],"In":[82],"work,":[84],"we":[85],"empirically":[86],"build":[87],"system":[89],"prove":[91],"execution":[93],"circuit":[96],"rather":[100],"produce":[102],"knowledge.":[106],"This":[107],"can":[109],"then":[110],"be":[111],"used":[112],"part":[114],"verifiable":[117],"folding":[118],"scheme":[119],"Nova,":[120],"reduces":[122],"complexity":[124],"an":[126],"computation":[130],"from":[139],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathrm{O}(n)$</tex>":[142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(1)$</tex>":[146],"by":[147],"providing":[148],"at":[149],"step":[151],"single":[153],"that":[155],"proves":[156],"whole":[158],"chain.":[160],"To":[161],"our":[162],"knowledge,":[163],"first":[167],"application":[168],"type":[171],"solution":[173],"problem.":[176]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}