Choosing parameters to achieve a higher success rate for hellman time memory trade off attack

Proceedings - International Conference on Availability, Reliability and Security, ARES 2009

Volumn , Issue , 2009, Pages 504-509

  Saran, Nurdan ^a   Doǧanaksoy, Ali ^b  

^a CANKAYA UNIVERSITY   (Turkey)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Cryptanalysis; Success probability; Symmetric key cryptography; Time memory trade off attack

Indexed keywords

BLOCK CIPHERS; CRYPTANALYSIS; DES (DATA ENCRYPTION STANDARD); EXHAUSTIVE SEARCH; NEW PARAMETERS; ONE-WAY FUNCTIONS; PREIMAGES; PROBABILISTIC METHODS; SEARCH OPERATIONS; SUCCESS PROBABILITY; SYMMETRIC KEY CRYPTOGRAPHY; TIME MEMORY TRADE OFF ATTACK; TMTO ATTACKS; TRADE OFF;

COMMERCE; CRYPTOGRAPHY; SECURITY OF DATA; TABLE LOOKUP;

COMPUTER CRIME;

EID: 70349669575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2009.140     Document Type: Conference Paper

References (20)

1. G. Avoine, P. Junod, and P. Oechslin. Time-memory trade-offs: False alarm detection using checkpoints. In S. Maitra, C. E. V. Madhavan, and R. Venkatesan, editors, INDOCRYPT, volume 3797 of Lecture Notes in Computer Science, pages 183-196. Springer, 2005.
2. G. Avoine, P. Junod, and P. Oechslin. Characterization and improvement of time-memory trade-off based on perfect tables. ACM Trans. Inf. Syst. Secur., 11(4):1-22, 2008.
3. S. Babbage. Improved "'exhaustive search'" attacks on stream ciphers. In ECOS 95 (European Convention on Security and Detection), number 408 in IEE Conference Publication, May 1995.
4. E. Barkan, E. Biham, and A. Shamir. Rigorous bounds on cryptanalytic time/memory tradeoffs. In C. Dwork, editor, CRYPTO, volume 4117 of Lecture Notes in Computer Science, pages 1-21. Springer, 2006.
5. A. Biryukov, S. Mukhopadhyay, and P. Sarkar. Improved time-memory trade-offs with multiple data. In B. Preneel and S. E. Tavares, editors, Selected Areas in Cryptography, volume 3897 of Lecture Notes in Computer Science, pages 110-127. Springer, 2005.
6. A. Biryukov and A. Shamir. Cryptanalytic time/memory/data tradeoffs for stream ciphers. In T. Okamoto, editor, ASIACRYPT, volume 1976 of Lecture Notes in Computer Science, pages 1-13. Springer, 2000.
7. A. Biryukov, A. Shamir, and D. Wagner. Real time cryptanalysis of a5/1 on a pc. In B. Schneier, editor, FSE, volume 1978 of Lecture Notes in Computer Science, pages 1-18. Springer, 2000.
8. J. Borst. Block Ciphers: Design, Analysis and Side-Channel Analysis. PhD thesis, Katholieke Universiteit Leuven, 2001.
9. J. Borst, B. Preneel, and J. Vandewalle. On timememory tradeoff between exhaustive key search and table precomputation. In P. H. N. de With and M. van der Schaar-Mitrea, editors, Proc. of 19th Symp. on Information Theory in the Benelux, pages 111-118, Veldhoven (NL), 28-29 1998. Werkgemeenschap Informatie- en Communicatietheorie, Enschede (NL).
10. C. Çalik. How to invert one-way functions: Timememory trade-off method. Master's thesis, METU, 2007.
11. J. D. Golic. Cryptanalysis of alleged a5 stream cipher. In EUROCRYPT, pages 239-255, 1997.
12. M. E. Hellman. A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory, 26(4):401-406, 1980.
13. J. Hong, K. C. Jeong, E. Y. Kwon, I.-S. Lee, and D. Ma. Variants of the distinguished point method for cryptanalytic time memory trade-offs. In L. Chen, Y. Mu, and W. Susilo, editors, ISPEC, volume 4991 of Lecture Notes in Computer Science, pages 131-145. Springer, 2008.
14. J. Hong and P. Sarkar. New applications of time memory data tradeoffs. In B. K. Roy, editor, ASIACRYPT, volume 3788 of Lecture Notes in Computer Science, pages 353-372. Springer, 2005.
15. J. Hong and P. Sarkar. Rediscovery of time memory tradeoffs, 2005.
16. I.-J. Kim and T. Matsumoto. Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size. IEICE Transactions on Fundamentals, E82-A(1):123-129, 1999.
17. K. Kusuda and T. Matsumoto. Optimization of timememory trade-off cryptanalysis and its application to des, feal-32 and skipjack. IEICE Transactions on Fundamentals, E79-A(1):35-48, 1996.
18. P. Oechslin. Making a faster cryptanalytic time-memory trade-off. In D. Boneh, editor, CRYPTO, volume 2729 of Lecture Notes in Computer Science, pages 617-630. Springer, 2003.
19. M.-J. O. Saarinen. A time-memory tradeoff attack against lili-128. In J. Daemen and V. Rijmen, editors, FSE, volume 2365 of Lecture Notes in Computer Science, pages 231-236. Springer, 2002.
20. F.-X. Standaert, G. Rouvroy, J.-J. Quisquater, and J.- D. Legat. A time-memory tradeoff using distinguished points: New analysis & fpga results. In B. S. K. Jr., Çetin Kaya Koç, and C. Paar, editors, CHES, volume 2523 of Lecture Notes in Computer Science, pages 593-609. Springer, 2002.