Analysis of the parallel distinguished point tradeoff

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7107 LNCS, Issue , 2011, Pages 161-180

  Hong, Jin ^a   Lee, Ga Won ^a   Ma, Daegun ^b  

^a Seoul National University   (South Korea)

^b Konkuk University   (South Korea)

Author keywords

distinguished point; parallel distinguished point; rainbow table; time memory tradeoff

Indexed keywords

COMPLEXITY RESULTS; DISTINGUISHED POINT; FALSE ALARMS; ONE-WAY FUNCTIONS; ONLINE TIME; PARALLEL DISTINGUISHED POINT; PARALLEL VERSION; PARALLELIZATIONS; POSITIVE EFFECTS; PRE-COMPUTATION; RAINBOW TABLES; SIDE EFFECT; THEORETIC ANALYSIS; TIME MEMORY TRADEOFF;

CRYPTOGRAPHY;

ALGORITHMS;

EID: 83755167984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25578-6_14     Document Type: Conference Paper

References (16)

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); Preliminary version presented at INDOCRYPT 2005
2. Borst, J.: Block Ciphers: Design, Analysis, and Side-Channel Analysis. Ph.D. Thesis, Katholieke Universiteit Leuven (September 2001)
3. 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)
4. Barkan, E., Biham, E., Shamir, A.: Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 1-21. Springer, Heidelberg (2006) (Pubitemid 44532106)
5. Biryukov, A., Shamir, A.: Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 1-13. Springer, Heidelberg (2000)
6. Biryukov, A., Shamir, A., Wagner, D.: Real Time Cryptanalysis of A5/1 on a PC. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 1-18. Springer, Heidelberg (2001)
7. Denning, D.E.: Cryptography and Data Security. Addison-Wesley (1982)
8. Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Trans. on Infor. Theory 26, pp. 401-406 (1980)
9. Hoch, Y.Z.: Security analysis of generic iterated hash functions. Ph.D. Thesis, Weizmann Institute of Science (August 2009)
10. Hong, J.: The cost of false alarms in Hellman and rainbow tradeoffs. Des. Codes Cryptogr. 57(3), 293-327 (2010)
11. Hong, J., Lee, G.W., Ma, D.: Analysis of the Parallel Distinguished Point Tradeoff. Cryptology ePrint Archive. Report 2011/387
12. Hong, J., Moon, S.: A comparison of cryptanalytic tradeoff algorithms. Cryptology ePrint Archive. Report 2010/176
13. Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space tradeoff. In: Proceedings of the 12th ACM CCS, pp. 364-372. ACM (2005)
14. Oechslin, P.: Making a Faster Cryptanalytic Time-Memory Trade-Off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 617-630. Springer, Heidelberg (2003)
15. Shamir, A.: Random Graphs in Security and Privacy. Invited talk at ICITS 2009 (2009)
16. 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ç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 593-609. Springer, Heidelberg (2003) (Pubitemid 137638963)