{"id":"https://openalex.org/W7170169770","doi":"https://doi.org/10.4230/lipics.ccc.2026.18","title":"Multiplicative Pseudorandom Generators for Nondeterministic Circuits","display_name":"Multiplicative Pseudorandom Generators for Nondeterministic Circuits","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170169770","doi":"https://doi.org/10.4230/lipics.ccc.2026.18"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.18","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.18","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5143496284","display_name":"Alon Dermer","orcid":null},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dermer, Alon","raw_affiliation_strings":["Department of Computer Science, University of Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062263696","display_name":"Ronen Shaltiel","orcid":"https://orcid.org/0000-0002-5182-593X"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shaltiel, Ronen","raw_affiliation_strings":["Department of Computer Science, University of Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0002-5182-593X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.9192000031471252},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.8041999936103821},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.6498000025749207},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.49300000071525574},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4765999913215637},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.47530001401901245},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.47519999742507935},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.40560001134872437}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.9192000031471252},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8041999936103821},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.6498000025749207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5012000203132629},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.49300000071525574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.492000013589859},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4765999913215637},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.47530001401901245},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.47519999742507935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44859999418258667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41929998993873596},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.40560001134872437},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.37369999289512634},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.33970001339912415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3384000062942505},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.329800009727478},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.314300000667572},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C151881341","wikidata":"https://www.wikidata.org/wiki/Q910571","display_name":"Pseudorandom noise","level":4,"score":0.28619998693466187},{"id":"https://openalex.org/C137546455","wikidata":"https://www.wikidata.org/wiki/Q3213474","display_name":"Trigram","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C18017163","wikidata":"https://www.wikidata.org/wiki/Q13560113","display_name":"Randomness tests","level":3,"score":0.26969999074935913},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.18","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.18","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"hardness":[1,15,250,271,321,354],"vs.":[2],"randomness":[3],"paradigm":[4],"aims":[5],"to":[6,82,173,442,478,490],"construct":[7],"pseudorandom":[8],"generators":[9],"(PRGs)":[10],"based":[11],"on":[12,247],"complexity":[13],"theoretic":[14],"assumptions.":[16],"A":[17,40],"seminal":[18],"result":[19,68,336,374],"in":[20,124,304,329,396],"this":[21,175,231,253],"area":[22],"is":[23,110,212,219,223,289,324,363,400],"a":[24,186,290,320,352],"PRG":[25,292,342,381,408,417,426],"construction":[26,259,343,409,427],"by":[27],"[N.":[28,70],"Nisan":[29,71],"and":[30,36,46,53,62,72,78,85,104,127,222,307,326,358,423,430,434,449,466,484],"A.":[31,37,73,79],"Wigderson,":[32,38,74,80],"1994;":[33,75],"R.":[34,51,60,76],"Impagliazzo":[35,77],"1997].":[39],"sequence":[41],"of":[42,69,95,189,260,332,344,382,418,428,446,453,463],"works":[43],"[A.":[44],"Klivans":[45],"D.":[47],"van":[48],"Melkebeek,":[49],"2002;":[50],"Shaltiel":[52,61,383,419,429,433],"C.":[54,57,63,435],"Umans,":[55,58,64,436],"2005;":[56],"2003;":[59],"2006]":[65],"generalized":[66],"the":[67,269,315,339,360,364,378,404,413,424,444,447,450,454,460,473,492],"1997]":[81],"nondeterministic":[83,93,131,139,264,278,311],"circuits,":[84,279],"showed":[86,159],"that":[87,122,160,208,228,282,302,323,387],"if":[88,215],"E":[89],"=":[90,114,143,147,169,195,201,210,217,244,294,367],"DTIME(2^{O(n)})":[91],"requires":[92,192],"circuits":[94],"size":[96,129,137,309],"2^{\u03a9(n)},":[97],"then":[98],"for":[99,135,167,226,242,263,274,277,283],"every":[100,105,136,284],"sufficiently":[101],"large":[102],"s,":[103],"\u03b5":[106,168,243,285],"\u2265":[107,286],"1/s,":[108],"there":[109,288],"an":[111,257],"\u03b5-PRG":[112],"G:{0,1}^{r":[113,293],"O(log":[115,295,368,371],"s":[116,130,138,296,310],"+":[117,149,203,297,370],"log":[118,298],"1/(\u03b5))}":[119,299],"\u2192":[120,300],"{0,1}^s":[121,301],"runs":[123,303],"time":[125,305],"poly(s),":[126],"fools":[128,308],"circuits.":[132,265,312],"In":[133,171,252],"particular,":[134],"circuit":[140],"C,":[141],"Pr[C(G(U_r))":[142,194,209],"1]":[144,148,196,202,211,218],"\u2264":[145,197],"Pr[C(U_s)":[146,200,216],"\u03b5.":[150,204],"Applebaum":[151,155],"et":[152,156,178,182,235,347,470],"al.":[153,179],"[B.":[154],"al.,":[157,183,236,348,471],"2015]":[158],"\"black-box":[161],"techniques\"":[162],"cannot":[163],"achieve":[164],"such":[165,239],"results":[166,462,475],"s^{-\u03c9(1)}.":[170],"order":[172],"circumvent":[174],"problem,":[176],"Artemenko":[177,181,234,346],"[S.":[180,233,345],"2016]":[184,237],"suggested":[185],"\"multiplicative\"":[187],"version":[188],"PRGs,":[190],"which":[191,350],"that:":[193],"2":[198],"\u22c5":[199],"This":[205,313],"still":[206],"gives":[207,314],"very":[213,220,248,390,480],"small,":[214,221],"therefore":[224],"suitable":[225],"applications":[227,331],"only":[229,388],"require":[230],"consequence.":[232],"constructed":[238],"multiplicative":[240,261,291,333,341,380],"PRGs":[241,262,276],"s^{-\u03c9(1)}":[245],"(based":[246],"strong":[249],"assumptions).":[251],"paper,":[254],"we":[255,280,440,485],"give":[256],"optimal":[258,316],"More":[266],"specifically,":[267],"under":[268,319],"same":[270],"assumption":[272,322,355],"used":[273],"(standard)":[275,425],"show":[281],"1/(2^{s)},":[287],"poly(s)":[306],"seed":[317,361,405],"length":[318,362,395],"necessary,":[325],"provides":[327],"improvements":[328],"several":[330,487],"PRGs.":[334],"Our":[335,373,407],"improves":[337,376],"upon":[338,377],"previous":[340],"2016],":[349],"uses":[351],"stronger":[353],"against":[356],"\u03a3\u2083-circuits,":[357],"where":[359],"suboptimal":[365],"r":[366],"s)":[369],"1/(\u03b5))\u00b2.":[372],"also":[375],"recent":[379,414],"[R.":[384,397,420,432],"Shaltiel,":[385,398,421],"2025]":[386,399],"achieves":[389],"small":[391],"stretch":[392],"(the":[393],"output":[394],"less":[401],"than":[402],"twice":[403],"length).":[406],"borrows":[410],"ideas":[411,489],"from":[412],"\"low":[415],"stretch\"":[416,452],"2025],":[422],"Umans":[431],"2005].":[437],"Loosely":[438],"speaking,":[439],"aim":[441],"get":[443],"\"multiplicativity\"":[445],"former,":[448],"\"large":[451],"latter.":[455],"While":[456],"both":[457],"approaches":[458,494],"generalize":[459],"list-decoding":[461],"Sudan,":[464],"Trevisan":[465],"Vadhan":[467],"[M.":[468],"Sudan":[469],"2001],":[472],"two":[474,479,493],"are":[476],"tailored":[477],"different":[481],"parameter":[482],"regimes,":[483],"introduce":[486],"new":[488],"make":[491],"co-exist.":[495]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}