Skip to main content
SpringerLink
Log in

On the Effectiveness of TMTO and Exhaustive Search Attacks

  • Conference paper
Advances in Information and Computer Security (IWSEC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4266))

Included in the following conference series:

Abstract

In this paper, we consider time/memory trade-off (TMTO) and exhaustive search attacks and analyze their effectiveness on various key sizes. The first part of the paper is an overview of TMTO methodology and summarizes earlier work on hardware implementation of TMTO and exhaustive search attacks. The second part of the paper develops a cost model for analysing the effectiveness of generic attacks. Analysis of the cost model shows that 128-bit keys seem safe for the present. However, key sizes less than 96 bits do not provide comfortable security assurances. This is particularly relevant for the 80-bit stream ciphers in the Ecrypt call for stream ciphers as well as for the A5/3 encryption algorithm used in GSM mobile phones.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 3GPP TS 55.215 V6.2.0 (2003-09), A5/3 and GEA3 Specifications, available from: http://www.gsmworld.com

  2. Electronics Frontier Foundation, Cracking DES. O’Reilly and Associates, Sebastopol (1998)

    Google Scholar 

  3. Amirazizi, H.R., Hellman, M.E.: Time-memory-processor trade-offs. IEEE Transactions on Information Theory 34(3), 505–512 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  4. Babbage, S.H.: Improved exhaustive search attacks on stream ciphers. In: European Convention on Security and Detection, IEE Conference publication, vol. 408, pp. 161–166 (1995)

    Google Scholar 

  5. Bernstein, D.J.: Understanding brute force (2005), http://cr.yp.to/papers.html#bruteforce

  6. Biryukov, A., Shamir, A., Wagner, D.: Real Time Cryptanalsis of A5/1 on a PC. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 1–18. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Biryukov, A., Shamir, A.: Cyptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 1–13. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Diffie, W., Hellman, M.: Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer 10(6), 74–84 (1977)

    Article  Google Scholar 

  9. Fiat, A., Naor, M.: Rigorous time/space tradeoffs for inverting functions. In: STOC 1991, pp. 534–541 (1991)

    Google Scholar 

  10. Golić, J.D.: Cryptanalysis of alleged A5 stream cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 239–255. Springer, Heidelberg (1997)

    Google Scholar 

  11. Good, T., Benaissa, M.: AES on FPGA from the Fastest to the Smallest. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 427–440. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Hellman, M.: A cryptanalytic Time-Memory Trade-off. IEEE Transactions on Information Theory 26, 401–406 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hong, J., Sarkar, P.: New Applications of Time Memory Data Tradeoffs. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 353–372. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Mentens, N., Batina, L., Preneel, B., Verbauwhede, I.: Cracking Unix passwords using FPGA platforms. In: The proceedings of SHARCS 2005 (2005)

    Google Scholar 

  15. Mukhopadhyay, S., Sarkar, P.: Hardware Architecture and Trade-offs for Generic Inversion of One-way Functions. In: 2006 IEEE International Symposium on Circuits and Systems (ISCAS 2006) (2006), Full version available as (Indian Statistical Institute Techinical Report No. ASD/2006/2)

    Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. Quisquater, J.J., Delescaille, J.P.: How easy is collision search? Application to DES. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 429–434. Springer, Heidelberg (1990)

    Google Scholar 

  18. Quisquater, J.J., Desmedt, Y.G.: Chinese Lotto as an Exhaustive Code-Breaking Machine. Computer 24(11), 14–22 (1991)

    Article  Google Scholar 

  19. Quisquater, J.J., Standaert, F.X.: Exhaustive Key Search of the DES: Updates and Refinements. In: SHARCS 2005 (2005)

    Google Scholar 

  20. Quisquater, J.J., Standaert, F.X., Rouvroy, G., David, J.P., Legat, J.D.: A Cryptanalytic Time-Memory Tradeoff: First FPGA Implementation. In: Glesner, M., Zipf, P., Renovell, M. (eds.) FPL 2002. LNCS, vol. 2438, pp. 780–789. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Wiener, M.J.: The Full Cost of Cryptanalytic Attacks. Journal of Cryptology 17(2), 105–124 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wiener, M.J.: Efficient DES Key Search. In: Crypto 1993 (rump session presentation), Santa Barbara, California, USA (August 1993); Reprint in: Stallings, W. (ed.): Practical Cryptography for Data Internetworks, pp. 31–79. IEEE Computer Society Press, Los Alamitos (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Projet CODES, INRIA Rocquencourt, B.P. 105, 78153 Cedex, Le Chesnay, France

    Sourav Mukhopadhyay

  2. Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata, 700 108, India

    Palash Sarkar

Authors
  1. Sourav Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Palash Sarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electro-Communication, The University of Electro-Communications, 1-5-1, Chofugaoka, P.O. Box, 182-8585, Chofu, Japan

    Hiroshi Yoshiura

  2. Department of Computer Science, Communication Engineering, Kyushu University, 812-0053, Fukuoka, Japan

    Kouichi Sakurai

  3. Institute of Business Informatics, Goethe University Frankfurt, Frankfurt/Main, Germany

    Kai Rannenberg

  4. Faculty of Software and Information Science, Iwate Prefectural University, 152-52 Sugo, Takizawa, Takizawa-mura, 020-0193, Iwate, Japan

    Yuko Murayama

  5. Toshiba Corporation, 1, Komukai Toshiba-cho, Saiwai-ku, P.O. Box, 212-8582, Kawasaki, Japan

    Shinichi Kawamura

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukhopadhyay, S., Sarkar, P. (2006). On the Effectiveness of TMTO and Exhaustive Search Attacks. In: Yoshiura, H., Sakurai, K., Rannenberg, K., Murayama, Y., Kawamura, S. (eds) Advances in Information and Computer Security. IWSEC 2006. Lecture Notes in Computer Science, vol 4266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908739_24

Download citation

  • DOI: https://doi.org/10.1007/11908739_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47699-3

  • Online ISBN: 978-3-540-47700-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation