Browse > Article
http://dx.doi.org/10.4134/BKMS.b150754

PERFORMANCE COMPARISON OF CRYPTANALYTIC TIME MEMORY DATA TRADEOFF METHODS  

Hong, Jin (Department of Mathematical Sciences and ISaC Seoul National University)
Kim, Byoung-Il (Department of Mathematical Sciences and ISaC Seoul National University)
Publication Information
Bulletin of the Korean Mathematical Society / v.53, no.5, 2016 , pp. 1439-1446 More about this Journal
Abstract
The execution complexities of the major time memory data tradeoff methods are analyzed in this paper. The multi-target tradeoffs covered are the classical Hellman, distinguished point, and fuzzy rainbow methods, both in their non-perfect and perfect table versions for the latter two methods. We show that their computational complexities are identical to those of the corresponding single-target methods executed under certain matching parameters and conclude that the perfect table fuzzy rainbow tradeoff method is most preferable.
Keywords
time memory data tradeoff; multi-target tradeoff; Hellman; distinguished point; fuzzy rainbow; cryptography;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. H. Babbage, Improved "exhaustive search" attacks on stream ciphers, In European Convention on Security and Detection, IEE Conference Publication (1995), no. 408, 161-166.
2 E. P. Barkan, Cryptanalysis of Ciphers and Protocols, Ph.D. Thesis, Technion-Israel Institute of Technology, March 2006.
3 E. Barkan, E. Biham, and A. Shamir, Rigorous bounds on cryptanalytic time/memory tradeoffs, In Advances in Cryptology-CRYPTO 2006, 1-21, Lecture Notes in Comput. Sci., 4117, Springer, Berlin, 2006.
4 A. Biryukov, S. Mukhopadhyay, and P. Sarkar, Improved time-memory trade-offs with multiple data, In SAC 2005, 110-127, Lecture Notes in Comput. Sci., 3897, Springer, Berlin, 2006.
5 A. Biryukov and A. Shamir, Cryptanalytic time/memory/data tradeoffs for stream ciphers, In Advances in Cryptology-ASIACRYPT 2000, 1-13, Lecture Notes in Comput. Sci., 1976, Springer, Berlin, 2000.
6 A. Biryukov, A. Shamir, and D. Wagner, Real time cryptanalysis of A5/1 on a PC, In FSE 2000, 1-18, Lecture Notes in Comput. Sci. 1978, Springer, 2001.
7 J. Borst, Block Ciphers: Design, Analysis, and Side-Channel Analysis, Ph.D. Thesis, Katholieke Universiteit Leuven, September 2001.
8 J. Borst, B. Preneel, and J. Vandewalle, 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.
9 D. E. Denning, Cryptography and Data Security, Addison-Wesley, 1982.
10 J. Dj. Golic, Cryptanalysis of alleged A5 stream cipher, In Advances in Cryptology-EUROCRYPT '97, 239-255, Lecture Notes in Comput. Sci. 1233, Springer, 1997.
11 M. E. Hellman, A cryptanalytic time-memory trade-off, IEEE Trans. Inform. Theory 26 (1980), no. 4, 401-406.   DOI
12 J. Hong and S. Moon, A comparison of cryptanalytic tradeoff algorithms, J. Cryptology 26 (2013), no. 4, 559-637.   DOI
13 B.-I. Kim and J. Hong, Analysis of the non-perfect table fuzzy rainbow tradeoff, In ACISP 2013, 347-362, Lecture Notes in Comput. Sci. 7959, Springer, 2013.
14 B.-I. Kim and J. Hong, Analysis of the perfect table fuzzy rainbow tradeoff, J. Appl. Math. 2014 (2014), Article ID 765394.
15 G. W. Lee and J. Hong, A comparison of perfect table cryptanalytic tradeoff algorithms, Des. Codes Cryptogr. 80 (2016), no. 3, 473-523.   DOI
16 K. Nohl, Attacking phone privacy, Presented at Black Hat USA 2010, Las Vegas, July 2010.
17 K. Nohl and C. Paget, GSM-SRSLY?, Presented at 26th Chaos Communication Congress (26C3), Berlin, December 2009.
18 P. Oechslin, Making a faster cryptanalytic time-memory trade-off, In Advances in Cryptology-CRYPTO 2003, 617-630, Lecture Notes in Comput. Sci., 2729, Springer, Berlin, 2003.