{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:38:40Z","timestamp":1743050320879,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319241739"},{"type":"electronic","value":"9783319241746"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24174-6_9","type":"book-chapter","created":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T11:36:32Z","timestamp":1444390592000},"page":"165-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Interleaving Cryptanalytic Time-Memory Trade-Offs on Non-uniform Distributions"],"prefix":"10.1007","author":[{"given":"Gildas","family":"Avoine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Carpent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Lauradoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,13]]},"reference":[{"key":"9_CR1","unstructured":"Atom: The Hashcat password cracker (2014). http:\/\/hashcat.net\/hashcat\/"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-12160-4_9","volume-title":"Information Security and Cryptology \u2013 ICISC 2013","author":"G Avoine","year":"2014","unstructured":"Avoine, G., Carpent, X.: Optimal storage for rainbow tables. In: Lee, H.-S., Han, D.-G. (eds.) ICISC 2013. LNCS, vol. 8565, pp. 144\u2013157. Springer, Heidelberg (2014)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11596219_15","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"G Avoine","year":"2005","unstructured":"Avoine, G., Junod, P., Oechslin, P.: Time-memory trade-offs: false alarm detection using checkpoints. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 183\u2013196. Springer, Heidelberg (2005)"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1380564.1380565","volume":"11","author":"G Avoine","year":"2008","unstructured":"Avoine, G., Junod, P., Oechslin, P.: Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans. Inf. Syst. Secur. TISSEC 11(4), 1\u201322 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur. TISSEC"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11818175_1","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"E Barkan","year":"2006","unstructured":"Barkan, E., Biham, E., Shamir, A.: Rigorous Bounds on cryptanalytic time\/memory tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 1\u201321. Springer, Heidelberg (2006)"},{"key":"9_CR6","unstructured":"Barkan, E.P.: Cryptanalysis of ciphers and protocols. Ph.D. thesis, Technion - Israel Institute of Technology, Haifa, Israel, March 2006"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bonneau, J.: The science of guessing: analyzing an anonymized corpus of 70 million passwords. In: IEEE Symposium on Security and Privacy - S&P 2012, San Francisco, CA, USA. IEEE Computer Society, May 2012","DOI":"10.1109\/SP.2012.49"},{"key":"9_CR8","first-page":"100","volume-title":"Cryptography and Data Security","author":"D Denning","year":"1982","unstructured":"Denning, D.: Cryptography and Data Security, p. 100. Addison-Wesley, Boston (1982)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M Hellman","year":"1980","unstructured":"Hellman, M.: A cryptanalytic time-memory trade off. IEEE Trans. Inf. Theory IT 26(4), 401\u2013406 (1980)","journal-title":"IEEE Trans. Inf. Theory IT"},{"key":"9_CR10","unstructured":"Hoch, Y.Z.: Security analysis of generic iterated hash functions. Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel, August 2009"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-79104-1_10","volume-title":"Information Security Practice and Experience","author":"J Hong","year":"2008","unstructured":"Hong, J., Jeong, K.C., Kwon, E.Y., Lee, I.-S., Ma, D.: Variants of the distinguished point method for cryptanalytic time memory trade-offs. In: Chen, L., Mu, Y., Susilo, W. (eds.) ISPEC 2008. LNCS, vol. 4991, pp. 131\u2013145. Springer, Heidelberg (2008)"},{"key":"9_CR12","unstructured":"Lee, G.W., Hong, J.: A comparison of perfect table cryptanalytic tradeoff algorithms. Cryptology ePrint Archive, report 2012\/540 (2012)"},{"key":"9_CR13","unstructured":"Lestringant, P., Oechslin, P., Tissi\u00e8res, C.: Limites des tables rainbow et comment les d\u00e9passer en utilisant des m\u00e9thodes probabilistes optimis\u00e9es (in French). In: Symposium sur la s\u00e9curit\u00e9 des technologies de l\u2019information et des communications - SSTIC, Rennes, France, June 2013"},{"key":"9_CR14","unstructured":"Massey, J.L.: Guessing and entropy. In: International Symposium on Information Theory - ISIT 1994, Trondheim, Norway, p. 204. IEEE, June 1994"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space tradeoff. In: ACM Conference on Computer and Communications Security - CCS 2005, Alexandria, VA, USA, pp. 364\u2013372. ACM, November 2005","DOI":"10.1145\/1102120.1102168"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-45146-4_36","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"P Oechslin","year":"2003","unstructured":"Oechslin, P.: Making a faster cryptanalytic time-memory trade-off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 617\u2013630. Springer, Heidelberg (2003)"},{"key":"9_CR17","unstructured":"Oechslin, P.: The ophcrack password cracker (2014). http:\/\/ophcrack.sourceforge.net\/"},{"key":"9_CR18","unstructured":"Peslyak, A.: The John the Ripper password cracker (2014). http:\/\/www.openwall.com\/john\/"},{"key":"9_CR19","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2003","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, vol. 2. Pearson Education, Upper Saddle River (2003)"},{"key":"9_CR20","unstructured":"Shuanglei, Z.: The RainbowCrack project (2014). http:\/\/project-rainbowcrack.com\/"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/3-540-36400-5_43","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"F-X Standaert","year":"2002","unstructured":"Standaert, F.-X., Rouvroy, G., Quisquater, J.-J., Legat, J.-D.: A time-memory tradeoff using distinguished points: new analysis & FPGA results. In: Kaliski, B.S., Ko\u00e7, C.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 593\u2013609. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Security -- ESORICS 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24174-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T08:05:41Z","timestamp":1700208341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-24174-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319241739","9783319241746"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24174-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}