We study two open problems proposed by Wagner in his seminal work on the generalized birthday problem. First, with the use of multicollisions, we improve Wagner’s k-tree algorithm that solves the generalized birthday problem for the cases when k is not a power of two. The new k-tree only slightly outperforms Wagner’s k-tree. However, in some applications this suffices, and as a proof of concept, we apply the new 3-tree algorithm to slightly reduce the security of two CAESAR proposals. Next, with the use of multiple collisions based on Hellman’s table, we give improvements to the best known time-memory tradeoffs for the k-tree. As a result, we obtain the a new tradeoff curve T2·Mlg k−1 = k ·N. For instance, when k = 4, the tradeoff has the form T2M = 4·N.
CITATION STYLE
Nikolić, I., & Sasaki, Y. (2015). Refinements of the k-tree algorithm for the generalized birthday problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9453, pp. 683–703). Springer Verlag. https://doi.org/10.1007/978-3-662-48800-3_28
Mendeley helps you to discover research relevant for your work.