Performance comparison of cryptanalytic time memory data tradeoff methods
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (18)
- S. H. Babbage, "“exhaustive search” attacks on stream ciphers, In European Convention on Security and Detection", IEE Conference Publication, pp.161~166 (1995)
- E. P. Barkan, "Cryptanalysis of Ciphers and Protocols", Ph.D., pp.2006
- E. Barkan, "Rigorous bounds on cryptanalytic time", memory tradeoffs, 2006, 1~21[DOI]
- A. Biryukov, "Improved time-memory trade-offs with multiple data", SAC 2005, pp.110~127 (2006), Springer
- A. Biryukov, "Cryptanalytic time", memory, Advances in Cryptology—ASIACRYPT 2000, pp.2000[DOI]
- A. Biryukov, "Real time cryptanalysis of A5", 1 on a PC, 2001, 1~18[DOI]
- J. Borst, "Block Ciphers: Design, Analysis, and Side-Channel Analysis", Ph.D., pp.2001
- J. Borst, "On the time-memory tradeoff betweeen exhaus-tive key search and table precomputation", Proceedings of the 19th Symposium on Information Theory in the Benelux (1998), WIC
- D. E. Denning, "Cryptography and Data Security" (1982), Addison-Wesley
- J. Dj. Golic, "Cryptanalysis of alleged A5 stream cipher", Advances in Cryptology—EUROCRYPT ’97, pp.239~255 (1997), Springer
- M. E. Hellman, "A cryptanalytic time-memory trade-off, IEEE Trans", Inform. Theory, 26(4), pp.401~406 (1980)
- J. Hong, "A comparison of cryptanalytic tradeoff algorithms", J. Cryptology, 26(4), pp.559~637 (2013)
- B.-I. Kim, "Analysis of the non-perfect table fuzzy rainbow tradeoff", ACISP 2013, pp.347~362 (2013), Springer
- B.-I. Kim, "Analysis of the perfect table fuzzy rainbow tradeoff", J. Appl. Math, 2014 (2014)
- G. W. Lee, "A comparison of perfect table cryptanalytic tradeoff algorithms", Des. Codes Cryptogr, 80(3), pp.473~523 (2016)
- K. Nohl, "Attacking phone privacy", Presented at Black Hat USA 2010 (2010)
- K. Nohl, "GSM-SRSLY?", Presented at 26th Chaos Communication Congress (2009)
- P. Oechslin, "Making a faster cryptanalytic time-memory trade-off", Advances in Cryptology—CRYPTO 2003, pp.617~630 (2003), Springer