{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T11:38:01Z","timestamp":1777030681751,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,26]],"date-time":"2015-07-26T00:00:00Z","timestamp":1437868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2012R1A1B4003379"],"award-info":[{"award-number":["NRF-2012R1A1B4003379"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2011-0030901"],"award-info":[{"award-number":["NRF-2011-0030901"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10623-015-0116-0","type":"journal-article","created":{"date-parts":[[2015,7,25]],"date-time":"2015-07-25T03:32:12Z","timestamp":1437795132000},"page":"473-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Comparison of perfect table cryptanalytic tradeoff algorithms"],"prefix":"10.1007","volume":"80","author":[{"given":"Ga Won","family":"Lee","sequence":"first","affiliation":[]},{"given":"Jin","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,26]]},"reference":[{"key":"116_CR1","unstructured":"\u00c5gren M., Johansson T., Hell M.: Improving the rainbow attack by reusing colours. CANS 2009. LNCS, vol. 5888, pp. 362\u2013378. Springer, Berlin (2009)."},{"key":"116_CR2","doi-asserted-by":"crossref","unstructured":"Avoine G., Junod P., Oechslin P.: Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans. Inf. Syst. Secur. 11(4), 17:1\u201317:22 (2008). Preliminary version presented at INDOCRYPT 2005.","DOI":"10.1145\/1380564.1380565"},{"key":"116_CR3","unstructured":"Barkan E.P.: Cryptanalysis of Ciphers and Protocols. Ph.D. Thesis, Technion\u2014Israel Institute of Technology, Haifa (2006)."},{"key":"116_CR4","doi-asserted-by":"crossref","unstructured":"Barkan E., Biham E., Shamir A.: Rigorous bounds on cryptanalytic time\/memory tradeoffs. Advances in Cryptology\u2014CRYPTO 2006. LNCS, vol. 4117, pp. 1\u201321. Springer, Heidelberg (2006).","DOI":"10.1007\/11818175_1"},{"key":"116_CR5","doi-asserted-by":"crossref","unstructured":"Biryukov A., Shamir A.: Cryptanalytic time\/memory\/data tradeoffs for stream ciphers. In: Advances in Cryptology\u2014ASIACRYPT 2000. LNCS, vol. 1976, pp. 1\u201313. Springer, Heidelberg (2000).","DOI":"10.1007\/3-540-44448-3_1"},{"key":"116_CR6","doi-asserted-by":"crossref","unstructured":"Biryukov A., Shamir A., Wagner D.: Real time cryptanalysis of A5\/1 on a PC. In: FSE 2000, LNCS, vol. 1978, pp. 1\u201318. Springer, Heidelberg (2001).","DOI":"10.1007\/3-540-44706-7_1"},{"key":"116_CR7","unstructured":"Borst J.: Block Ciphers: Design, Analysis, and Side-Channel Analysis. Ph.D. Thesis, Katholieke Universiteit Leuven, Leuven (2001)."},{"key":"116_CR8","unstructured":"Borst J., Preneel B., Vandewalle J.: On the time-memory tradeoff between exhaustive key search and table precomputation. In: Proceedings of the 19th Symposium on Information Theory in the Benelux, pp. 111\u2013118. WIC (1998)."},{"key":"116_CR9","unstructured":"Denning D.E.: Cryptography and Data Security. Addison-Wesley, Reading (1982)."},{"key":"116_CR10","doi-asserted-by":"crossref","unstructured":"Fiat A., Naor M.: Rigorous time\/space tradeoffs for inverting functions. In: Proceedings of the twenty-third annual ACM Symposium on Theory of Computing, pp. 534\u2013541. ACM, New York (1991).","DOI":"10.1145\/103418.103473"},{"key":"116_CR11","doi-asserted-by":"crossref","unstructured":"Hellman M.E.: A cryptanalytic time-memory trade-off. IEEE Trans. Inf. Theory 26, 401\u2013406 (1980).","DOI":"10.1109\/TIT.1980.1056220"},{"key":"116_CR12","unstructured":"Hoch Y.Z.: Security analysis of generic iterated hash functions. Ph.D. Thesis, Weizmann Institute of Science, Rehovot (2009)."},{"key":"116_CR13","doi-asserted-by":"crossref","unstructured":"Hong J.: The cost of false alarms in Hellman and rainbow tradeoffs. Des. Codes Cryptogr. 57(3), 293\u2013327 (2010).","DOI":"10.1007\/s10623-010-9368-x"},{"key":"116_CR14","doi-asserted-by":"crossref","unstructured":"Hong J., Moon S.: A comparison of cryptanalytic tradeoff algorithms. J. Cryptol. 26(4), 559\u2013637 (2013).","DOI":"10.1007\/s00145-012-9128-3"},{"key":"116_CR15","doi-asserted-by":"crossref","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: ISPEC 2008. LNCS, vol. 4991, pp. 131\u2013145. Springer, Heidelberg (2008).","DOI":"10.1007\/978-3-540-79104-1_10"},{"key":"116_CR16","doi-asserted-by":"crossref","unstructured":"Hong J., Lee G.W., Ma D.: Analysis of the parallel distinguished point tradeoff. In: Progress in Cryptology\u2014INDOCRYPT 2011. LNCS, vol. 7107, pp. 161\u2013180. Springer, Heidelberg (2011).","DOI":"10.1007\/978-3-642-25578-6_14"},{"key":"116_CR17","doi-asserted-by":"crossref","unstructured":"Kim B.-I., Hong J.: Analysis of the non-perfect table fuzzy rainbow tradeoff. In: ACISP 2013. LNCS, vol. 7959, pp. 347\u2013362. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-39059-3_24"},{"key":"116_CR18","doi-asserted-by":"publisher","unstructured":"Kim B.-I., Hong J.: Analysis of the perfect table fuzzy rainbow tradeoff. J. Appl. Math. 2014, 765394 (2014). doi: 10.1155\/2014\/765394 .","DOI":"10.1155\/2014\/765394"},{"key":"116_CR19","doi-asserted-by":"crossref","unstructured":"Kim J.W., Seo J., Hong J., Park K., Kim S.-R.: High-speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system. Softw. Pract. Exper. 45(6), 837\u2013855 (2015).","DOI":"10.1002\/spe.2257"},{"key":"116_CR20","unstructured":"Mukhopadhyay S., Sarkar P.: Nearly orthogonal rainbow tables. Indian Statistical Institute Technical Report, No. ASD\/2004\/9, November (2004)."},{"key":"116_CR21","doi-asserted-by":"crossref","unstructured":"Oechslin P.: Making a faster cryptanalytic time-memory trade-off. In: Advances in Cryptology\u2014CRYPTO 2003, LNCS, vol. 2729, pp. 617\u2013630. Springer, Heidelberg (2003).","DOI":"10.1007\/978-3-540-45146-4_36"},{"key":"116_CR22","unstructured":"Quisquater J.-J., Stern J.: Time-Memory Tradeoff Revisited. Unpublished, December (1998)."},{"key":"116_CR23","unstructured":"Saran N.: Time Memory Trade Off Attack on Symmetric Ciphers. Ph.D. Thesis, Middle East Technical University, Ankara (2009)."},{"key":"116_CR24","unstructured":"Shamir A.: Random Graphs in Security and Privacy. Invited talk at ICITS (2009)."},{"key":"116_CR25","doi-asserted-by":"crossref","unstructured":"Standaert F.-X., Rouvroy G., Quisquater J.-J., Legat J.-D.: A time-memory tradeoff using distinguished points: New analysis & FPGA results. In: Cryptographic Hardware and Embedded Systems\u2014CHES 2002, LNCS, vol. 2523, pp. 593\u2013609. Springer, Heidelberg (2003).","DOI":"10.1007\/3-540-36400-5_43"},{"key":"116_CR26","doi-asserted-by":"crossref","unstructured":"Thing V.: Virtual expansion of rainbow tables. In: Advances in Digital Forensics VI, pp. 243\u2013256. IFIP AICT 337 (2010).","DOI":"10.1007\/978-3-642-15506-2_17"},{"key":"116_CR27","doi-asserted-by":"crossref","unstructured":"Thing V.L.L., Ying H.-M.: A novel time-memory trade-off method for password recovery. Digital Investigation 6, S114\u2013S120 (2009).","DOI":"10.1016\/j.diin.2009.06.004"},{"key":"116_CR28","unstructured":"Thing V.L.L., Ying H.-M.: Rainbow table optimization for password recovery. Int. J. Adv. Softw. 4, 479\u2013488 (2011)."},{"key":"116_CR29","doi-asserted-by":"crossref","unstructured":"Toma\u0161evi\u0107 V., Toma\u0161evi\u0107 M.: An analysis of chain characteristics in the cryptanalytic TMTO method. Theor. Comput. Sci. 501, 52\u201361 (2013).","DOI":"10.1016\/j.tcs.2013.05.018"},{"key":"116_CR30","doi-asserted-by":"crossref","unstructured":"Wang W., Lin D.: Analysis of multiple checkpoints in non-perfect and perfect rainbow tradeoff revisited. In: ICICS 2013. LNCS, vol. 8233, pp. 288\u2013301. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-319-02726-5_21"},{"key":"116_CR31","doi-asserted-by":"crossref","unstructured":"Wang W., Lin D., Li Z., Wang T.: Improvement and analysis of VDP method in time\/memory tradeoff applications. In: ICICS 2011. LNCS, vol. 7043, pp. 282\u2013296. Springer, Heidelberg (2011).","DOI":"10.1007\/978-3-642-25243-3_23"},{"key":"116_CR32","doi-asserted-by":"crossref","unstructured":"Wiener M.J.: The full cost of cryptanalytic attacks. J. Cryptol. 17(2), 105\u2013124 (2004).","DOI":"10.1007\/s00145-003-0213-5"},{"key":"116_CR33","unstructured":"Ying H.-M., Thing V.L.L.: A novel rainbow table sorting method. CYBERLAWS 2011, 35\u201340 (2011)."},{"key":"116_CR34","doi-asserted-by":"crossref","unstructured":"Zhang W., Zhang M., Liu Y., Wang R.: A new time-memory-resource trade-off method for password recovery. In: ICCIIS 2010, pp. 75\u201379. IEEE, New York (2010).","DOI":"10.1109\/ICCIIS.2010.14"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0116-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0116-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0116-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T14:25:01Z","timestamp":1567002301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0116-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,26]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["116"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0116-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,26]]}}}