{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T05:11:03Z","timestamp":1750137063845,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-009"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-001"}],"funder":[{"DOI":"10.13039\/100004807","name":"DFG","doi-asserted-by":"publisher","award":["390781972"],"award-info":[{"award-number":["390781972"]}],"id":[{"id":"10.13039\/100004807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/csf54842.2022.9919640","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T01:29:20Z","timestamp":1667525360000},"page":"428-438","source":"Crossref","is-referenced-by-count":4,"title":["Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing"],"prefix":"10.1109","author":[{"given":"Alexander","family":"May","sequence":"first","affiliation":[{"name":"Ruhr University Bochum,Germany"}]},{"given":"Floyd","family":"Zweydinger","sequence":"additional","affiliation":[{"name":"Ruhr University Bochum,Germany"}]}],"member":"263","reference":[{"journal-title":"Ethereum 2 0","year":"2020","author":"foundation","key":"ref13"},{"key":"ref12","first-page":"94","article-title":"Low weight discrete logarithm and subset sum in 20.65n with polynomial memory","volume":"12107","author":"esser","year":"2020","journal-title":"EUROCRYPT 2020 Part III LNCS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45611-8_22"},{"journal-title":"Ethereum 2 0","year":"2020","author":"foundation","key":"ref14"},{"key":"ref11","first-page":"15","article-title":"Attacking elliptic curve cryptosystems using the parallel pollard rho method","volume":"4","author":"escott","year":"1999","journal-title":"CryptoBytes a technical newsletter of RSA Laboratories"},{"key":"ref10","first-page":"17","volume":"5","author":"erd\u00f6s","year":"1960","journal-title":"On the evolution of random graphs Publ Math Inst Hung Acad Sci"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90038-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56784-2_6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978332"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2017038"},{"journal-title":"Improved key recovery on the legendre PRF","year":"2020","author":"kaluderovic","key":"ref19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/080725398"},{"key":"ref24","first-page":"433","volume":"58","author":"peralta","year":"1992","journal-title":"On the distribution of quadratic residues and non-residues modulo a prime number Mathematics of Computation"},{"journal-title":"An analysis of algorithms for solving discrete logarithms in fixed groups","year":"2010","author":"mihalcik","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.08.019"},{"key":"ref25","first-page":"918","volume":"32","author":"pollard","year":"1978","journal-title":"Monte carlo methods for index computation (mod p) Mathematics of computation"},{"key":"ref20","article-title":"Key recovery attacks on the Legendre PRFs within the birthday bound","author":"khovratovich","year":"2019","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref22","article-title":"Accelerating ID-based encryption based on trapdoor DL using pre-computation","author":"lee","year":"2011","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45537-X_17"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/PL00003816"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_13"},{"key":"ref7","first-page":"415","article-title":"The discrete-logarithm problem with preprocessing","volume":"10821","author":"corrigan-gibbs","year":"2018","journal-title":"EURO-CRYPT 2018 Part II LNCS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-8.1.46"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2020.i1.313-330"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34931-7_19"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44223-1_8"}],"event":{"name":"2022 IEEE 35th Computer Security Foundations Symposium (CSF)","start":{"date-parts":[[2022,8,7]]},"location":"Haifa, Israel","end":{"date-parts":[[2022,8,10]]}},"container-title":["2022 IEEE 35th Computer Security Foundations Symposium (CSF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9919409\/9919636\/09919640.pdf?arnumber=9919640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T23:29:42Z","timestamp":1699486182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9919640\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/csf54842.2022.9919640","relation":{},"subject":[],"published":{"date-parts":[[2022,8]]}}}