{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:57:43Z","timestamp":1757455063533,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T00:00:00Z","timestamp":1479081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T00:00:00Z","timestamp":1479081600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1319051","1314568"],"award-info":[{"award-number":["1319051","1314568"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1065288","1017471"],"award-info":[{"award-number":["1065288","1017471"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1347350","1314722"],"award-info":[{"award-number":["1347350","1314722"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00453-016-0239-3","type":"journal-article","created":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T14:54:17Z","timestamp":1479135257000},"page":"1196-1232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs"],"prefix":"10.1007","volume":"79","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]},{"given":"Noah","family":"Stephens-Davidowitz","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,14]]},"reference":[{"key":"239_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Halevi, S.: A model and architecture for pseudo-random generation with applications to \/dev\/random. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS \u201905, ACM, pp.\u00a0203\u2013212. New York, NY, USA (2005)","DOI":"10.1145\/1102120.1102148"},{"key":"239_CR2","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-90a","volume-title":"Recommendation for Random Number Generation Using Deterministic Random Bit Generators","author":"E Barker","year":"2012","unstructured":"Barker, E., Kelsey, J.: Recommendation for Random Number Generation Using Deterministic Random Bit Generators. NIST Special Publication, Oakland (2012)"},{"key":"239_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay S. (ed.) Advances in Cryptology\u2014EUROCRYPT. Lecture Notes in Computer Science, vol. 4004, pp. 409\u2013426. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/11761679_25"},{"key":"239_CR4","unstructured":"CVE-2008-0166. Common vulnerabilities and exposures (2008)"},{"key":"239_CR5","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Pointcheval, D., Ruhault, S., Vergniaud, D., Wichs, D.: Security analysis of pseudo-random number generators with input: \/dev\/random is not robust. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer Communications Security, CCS \u201913, ACM, pp.\u00a0647\u2013658. New York, NY, USA (2013)","DOI":"10.1145\/2508859.2516653"},{"key":"239_CR6","first-page":"419","volume":"2007","author":"L Dorrendorf","year":"2007","unstructured":"Dorrendorf, L., Gutterman, Z., Pinkas, B.: Cryptanalysis of the random number generator of the windows operating system. IACR Cryptol. ePrint Arch. 2007, 419 (2007)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"239_CR7","unstructured":"Eastlake, D., Schiller, J., Crocker, S.: Randomness Requirements for Security (2005). http:\/\/www.rfc-editor.org\/rfc\/rfc4086.txt"},{"key":"239_CR8","unstructured":"Ferguson, N.: Private communication (2013)"},{"key":"239_CR9","volume-title":"Practical Cryptography","author":"N Ferguson","year":"2003","unstructured":"Ferguson, N., Schneier, B.: Practical Cryptography, 1st edn. Wiley, New York (2003)","edition":"1"},{"key":"239_CR10","doi-asserted-by":"crossref","unstructured":"Gutterman, Z., Pinkas, B., Reinman, T.: Analysis of the linux random number generator. In: Proceedings of the 2006 IEEE Symposium on Security and Privacy. SP \u201906, IEEE Computer Society, pp.\u00a0371\u2013385. Washington, DC, USA (2006)","DOI":"10.1109\/SP.2006.5"},{"key":"239_CR11","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your Ps and Qs: detection of widespread weak keys in network devices. In: Proceedings of the 21st USENIX Security Symposium (2012)"},{"key":"239_CR12","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B., Ferguson, N.: Yarrow-160: notes on the design and analysis of the yarrow cryptographic pseudorandom number generator. In: Sixth Annual Workshop on Selected Areas in Cryptography, pp.\u00a013\u201333. Springer (1999)","DOI":"10.1007\/3-540-46513-8_2"},{"key":"239_CR13","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B., Wagner, D., Hall, C.: Cryptanalytic attacks on pseudorandom number generators. In: Vaudenay S. (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol.\u00a01372, pp.\u00a0168\u2013188. Springer, Berlin, Heidelberg (1998)","DOI":"10.1007\/3-540-69710-1_12"},{"key":"239_CR14","first-page":"251","volume":"2012","author":"P Lacharme","year":"2012","unstructured":"Lacharme, P., R\u00f6ck, A., Strubel, V., Videau, M.: The linux pseudorandom number generator revisited. IACR Cryptol. ePrint Arch. 2012, 251 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"239_CR15","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Hughes, J.P., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Public keys. In: Advances in cryptology\u2013CRYPTO 2012. Lecture Notes in Computer Science, vol. 7417, pp. 626\u2013642. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-32009-5_37"},{"issue":"3","key":"239_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"PQ Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptol. 15(3), 151\u2013176 (2002)","journal-title":"J. Cryptol."},{"issue":"2","key":"239_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.P.: A complete problem for statistical zero knowledge. J. ACM 50(2), 196\u2013249 (2003)","journal-title":"J. ACM"},{"key":"239_CR18","doi-asserted-by":"crossref","unstructured":"Schinlder, W., Killmann, W.: Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications. In: Kaliski, B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2002: 4th International Workshop, Redwood Shores, CA, USA, August 13\u201315, 2002, Revised Papers, pp. 431\u2013449. Springer, Berlin, Heidelberg (2003)","DOI":"10.1007\/3-540-36400-5_31"},{"key":"239_CR19","unstructured":"Wikipedia. \/dev\/random. http:\/\/en.wikipedia.org\/wiki\/\/dev\/random (2004). Accessed 09 Feb 2014"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0239-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0239-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0239-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T10:40:14Z","timestamp":1657708814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0239-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,14]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0239-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2016,11,14]]},"assertion":[{"value":"30 June 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}