{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T20:26:21Z","timestamp":1768249581841,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255779","type":"print"},{"value":"9783642255786","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25578-6_14","type":"book-chapter","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T02:36:57Z","timestamp":1323139017000},"page":"161-180","source":"Crossref","is-referenced-by-count":8,"title":["Analysis of the Parallel Distinguished Point Tradeoff"],"prefix":"10.1007","author":[{"given":"Jin","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ga Won","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daegun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-14_CR1.1","doi-asserted-by":"crossref","unstructured":"1. Avoine, G., Junod, P., Oechslin, P.: Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans. Inform. Syst. Secur., 11(4), 17:1-17:22 (2008)","DOI":"10.1145\/1380564.1380565"},{"key":"#cr-split#-14_CR1.2","unstructured":"2. Preliminary version presented at INDOCRYPT 2005"},{"key":"14_CR2","unstructured":"Borst, J.: Block Ciphers: Design, Analysis, and Side-Channel Analysis. Ph.D. Thesis, Katholieke Universiteit Leuven (September 2001)"},{"key":"14_CR3","unstructured":"Borst, J., Preneel, B., Vandewalle, J.: On the time-memory tradeoff betweeen exhaustive key search and table precomputation. In: Proceedings of the 19th Symposium on Information Theory in the Benelux, WIC (1998)"},{"key":"14_CR4","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.\u00a04117, pp. 1\u201321. Springer, Heidelberg (2006)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cryptanalytic Time\/Memory\/Data Tradeoffs for Stream Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44706-7_1","volume-title":"Fast Software Encryption","author":"A. Biryukov","year":"2001","unstructured":"Biryukov, A., Shamir, A., Wagner, D.: Real Time Cryptanalysis of A5\/1 on a PC. In: Schneier, B. (ed.) FSE 2000. LNCS, vol.\u00a01978, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"14_CR7","unstructured":"Denning, D.E.: Cryptography and Data Security. Addison-Wesley (1982)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Trans. on Infor. Theory 26, pp.\u00a0401\u2013406 (1980)","DOI":"10.1109\/TIT.1980.1056220"},{"key":"14_CR9","unstructured":"Hoch, Y.Z.: Security analysis of generic iterated hash functions. Ph.D. Thesis, Weizmann Institute of Science (August 2009)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10623-010-9368-x","volume":"57","author":"J. Hong","year":"2010","unstructured":"Hong, J.: The cost of false alarms in Hellman and rainbow tradeoffs. Des. Codes Cryptogr.\u00a057(3), 293\u2013327 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Hong, J., Lee, G.W., Ma, D.: Analysis of the Parallel Distinguished Point Tradeoff. Cryptology ePrint Archive. Report 2011\/387","DOI":"10.1007\/978-3-642-25578-6_14"},{"key":"14_CR12","unstructured":"Hong, J., Moon, S.: A comparison of cryptanalytic tradeoff algorithms. Cryptology ePrint Archive. Report 2010\/176"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space tradeoff. In: Proceedings of the 12th ACM CCS, pp. 364\u2013372. ACM (2005)","DOI":"10.1145\/1102120.1102168"},{"key":"14_CR14","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.\u00a02729, pp. 617\u2013630. Springer, Heidelberg (2003)"},{"key":"14_CR15","unstructured":"Shamir, A.: Random Graphs in Security and Privacy. Invited talk at ICITS 2009 (2009)"},{"key":"14_CR16","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":"2003","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 Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 593\u2013609. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25578-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T10:25:07Z","timestamp":1561026307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25578-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255779","9783642255786"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25578-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}