Bull. Korean Math. Soc. 2016; 53(5): 1439-1446
Online first article September 13, 2016 Printed September 30, 2016
https://doi.org/10.4134/BKMS.b150754
Copyright © The Korean Mathematical Society.
Jin Hong and Byoung-Il Kim
Seoul National University, Seoul National University
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
MSC numbers: Primary 68W40, 94A60
2009; 46(2): 303-309
2010; 47(1): 63-71
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd