{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:57:04Z","timestamp":1762390624083},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662456071"},{"type":"electronic","value":"9783662456088"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45608-8_16","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:46:39Z","timestamp":1415961999000},"page":"289-305","source":"Crossref","is-referenced-by-count":13,"title":["Memory-Demanding Password Scrambling"],"prefix":"10.1007","author":[{"given":"Christian","family":"Forler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Lucks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Wenzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-38980-1_8","volume-title":"Applied Cryptography and Network Security","author":"J.-P. Aumasson","year":"2013","unstructured":"Aumasson, J.-P., Neves, S., Wilcox-O\u2019Hearn, Z., Winnerlein, C.: BLAKE2: Simpler, Smaller, Fast as MD5. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol.\u00a07954, pp. 119\u2013135. Springer, Heidelberg (2013)"},{"key":"16_CR2","unstructured":"Barsuhn, A.: Cache-Timing Attack on scrypt. Bauhaus-Universit\u00e4t Weimar, Bachelor Dissertation (December 2013)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bellovin, S.M., Merrit, M.: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland (1992)","DOI":"10.1145\/168588.168618"},{"key":"16_CR4","unstructured":"Biryukov, A., Khovratovich, D.: Tradeoff cryptanalysis of Catena. PHC mailing list: discussions@password-hashing.net"},{"key":"16_CR5","unstructured":"Bradley, W.F.: Superconcentration on a Pair of Butterflies. CoRR\u00a0abs\/1401.7263 (2014)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput.\u00a019, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"16_CR7","unstructured":"Drepper, U.: Unix crypt using SHA-256 and SHA-512, http:\/\/www.akkadia.org\/drepper\/SHA-crypt.txt (accessed May 16, 2013)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-22792-9_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Dziembowski","year":"2011","unstructured":"Dziembowski, S., Kazana, T., Wichs, D.: Key-evolution schemes resilient to space-bounded leakage. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 335\u2013353. Springer, Heidelberg (2011)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: RFC 2898 - PKCS #5: Password-Based Cryptography Specification Version 2.0. Technical report, IETF (2000)","DOI":"10.17487\/rfc2898"},{"key":"16_CR10","unstructured":"Kamp, P.-H.: The history of md5crypt, http:\/\/phk.freebsd.dk\/sagas\/md5crypt.html (accessed May 16, 2013)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P.C. Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/322344.322354","volume":"29","author":"T. Lengauer","year":"1982","unstructured":"Lengauer, T., Tarjan, R.E.: Asymptotically tight bounds on time-space trade-offs in a pebble game. J. ACM\u00a029(4), 1087\u20131130 (1982)","journal-title":"J. ACM"},{"key":"16_CR13","unstructured":"Nvidia. Nvidia GeForce GTX 680 - Technology Overview (2012)"},{"key":"16_CR14","first-page":"119","volume-title":"Record of the Project MAC conference on concurrent systems and parallel computation, Chapter Computation schemata","author":"M.S. Paterson","year":"1970","unstructured":"Paterson, M.S., Hewitt, C.E.: Comparative schematology. In: Dennis, J.B. (ed.) Record of the Project MAC conference on concurrent systems and parallel computation, Chapter Computation schemata, pp. 119\u2013127. ACM, New York (1970)"},{"key":"16_CR15","unstructured":"Percival, C.: Cache Missing for Fun and Profit. BDSCan (2004)"},{"key":"16_CR16","unstructured":"Percival, C.: Stronger Key Derivation via Sequential Memory-Hard Functions. Presented at BSDCan (May 2009)"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TIT.1978.1055938","volume":"24","author":"J. Savage","year":"1978","unstructured":"Savage, J., Swamy, S.: Space-time trade-offs on the FFT algorithm. IEEE Transactions on Information Theory\u00a024(5), 563\u2013568 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR18","series-title":"LNCS","first-page":"498","volume-title":"ICALP 1979","author":"J.E. Savage","year":"1979","unstructured":"Savage, J.E., Swamy, S.: Space-Time Tradeoffs for Oblivious Interger Multiplications. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.\u00a071, pp. 498\u2013504. Springer, Heidelberg (1979)"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R. Sethi","year":"1975","unstructured":"Sethi, R.: Complete Register Allocation Problems. SIAM J. Comput.\u00a04(3), 226\u2013248 (1975)","journal-title":"SIAM J. Comput."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Swamy, S., Savage, J.E.: Space-Time Tradeoffs for Linear Recursion. In: POPL, pp. 135\u2013142 (1979)","DOI":"10.1145\/567752.567765"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Tompa, M.: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits. In: STOC, pp. 196\u2013204 (1978)","DOI":"10.1145\/800133.804348"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45608-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T05:35:49Z","timestamp":1650605749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}