{"id":"https://openalex.org/W195998943","doi":null,"title":"Non-uniform attacks against one-way functions and PRGs.","display_name":"Non-uniform attacks against one-way functions and PRGs.","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W195998943","mag":"195998943"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.2957","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.2957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2009/113/download/","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5081127804","display_name":"Anindya De","orcid":"https://orcid.org/0000-0001-6795-8211","observed_orcids":["https://orcid.org/0000-0001-6795-8211"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anindya De","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6795-8211","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057752375","display_name":"Luca Trevisan","orcid":"https://orcid.org/0000-0002-6982-8530","observed_orcids":["https://orcid.org/0000-0002-6982-8530"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luca Trevisan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6982-8530","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057481716","display_name":"Madhur Tulsiani","orcid":"https://orcid.org/0009-0008-3094-8835","observed_orcids":["https://orcid.org/0009-0008-3094-8835"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhur Tulsiani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"16","issue":null,"first_page":"113","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.7660999894142151,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10237","display_name":"Cryptography and Data Security","score":0.7660999894142151,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10159999877214432,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.05700000002980232,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/one-way-functions","display_name":"one-way functions","score":0.9860000014305115},{"id":"https://openalex.org/keywords/pseudorandom-generators","display_name":"pseudorandom generators","score":0.9980000257492065},{"id":"https://openalex.org/keywords/inversion-algorithm","display_name":"inversion algorithm","score":0.47200000286102295},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5270000100135803},{"id":"https://openalex.org/keywords/cryptanalysis","display_name":"cryptanalysis","score":0.42500001192092896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5140408277511597}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.2957","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.2957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2009/113/download/","raw_type":"text"},{"id":"mag:195998943","doi":null,"is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2009/113","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W258677105","https://openalex.org/W1603326665","https://openalex.org/W1857473325","https://openalex.org/W1971070826","https://openalex.org/W2006290558","https://openalex.org/W2012646342","https://openalex.org/W2020306457","https://openalex.org/W2061106457","https://openalex.org/W2084652510","https://openalex.org/W2121818942","https://openalex.org/W2148180254","https://openalex.org/W2159460804","https://openalex.org/W2163137752","https://openalex.org/W2164322063"],"related_works":["https://openalex.org/W1575640061","https://openalex.org/W2505660553","https://openalex.org/W7095774586","https://openalex.org/W1965029291","https://openalex.org/W2031495811","https://openalex.org/W3030751723","https://openalex.org/W2015826302","https://openalex.org/W1528732880","https://openalex.org/W2949310842","https://openalex.org/W3603570"],"abstract_inverted_index":{"We":[0,47],"study":[1],"the":[2,95,105,120,123,129,137],"power":[3],"of":[4,77,82,99,107,128],"non-uniform":[5],"attacks":[6],"against":[7],"one-way":[8],"functions":[9],"and":[10,14,41,55,109,111,122,125,146],"pseudorandom":[11],"generators.":[12],"Fiat":[13,108],"Naor":[15,110],"[FN99]":[16],"show":[17,48],"that":[18,30,49,68],"for":[19],"every":[20],"function":[21],"f:":[22],"[N]":[23,25],"\u2192":[24],"there":[26],"is":[27],"an":[28,50,74],"algorithm":[29,51],"inverts":[31,69],"f":[32,70],"everywhere":[33],"using":[34,52],"(ignoring":[35],"lower":[36,80],"order":[37],"factors)":[38],"time,":[39,53],"space":[40,54,124,145],"advice":[42,56,126,147],"at":[43,57,72],"most":[44,58],"N":[45,62],"3/4.":[46],"max{\u025b":[59],"5":[60],"4":[61],"3":[63,102],"4,":[64],"\u221a":[65,86],"\u025bN}":[66],"exists":[67],"on":[71],"least":[73],"\u025b":[75,100],"fraction":[76],"inputs.":[78],"A":[79],"bound":[81],"\u02dc":[83],"\u2126":[84],"(":[85],"\u025bN)":[87],"also":[88],"holds,":[89],"making":[90],"our":[91],"result":[92],"tight":[93],"in":[94,141],"\u201clow":[96],"end":[97],"\u201d":[98],"\u2264":[101],"N.":[103],"(Both":[104],"results":[106,132],"ours":[112],"are":[113],"formulated":[114],"as":[115],"more":[116],"general":[117],"trade-offs":[118],"between":[119],"time":[121,143],"length":[127],"algorithm.":[130],"The":[131],"quoted":[133],"above":[134],"correspond":[135],"to":[136],"interesting":[138],"special":[139],"case":[140],"which":[142],"equals":[144],"length.)":[148]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}