In your paper "Generic Framework for Key-Guessing Improvements", an example of optimal tree is given in appendix F.1. I tried to calculate F_4(y) = S^(-1)(S(y)+4)+y in this example, and found that the F_4 is different from the tree in this paper. After reading the code
trees_rectangle_f_delta.cc in this repository, I find that the tree in appendix F.1 is constructed by funtion S(S^(-1)(y)+4)+y instead of S^(-1)(S(y)+4). I wonder if I misunderstand the example, in other words, F_4(y) = S(S^(-1)(y)+4)+y but not S^(-1)(S(y)+4)+y in this example.
There may be a typo in appendix F.1, x + x' = F_delta(x + k).
In your paper "Generic Framework for Key-Guessing Improvements", an example of optimal tree is given in appendix F.1. I tried to calculate F_4(y) = S^(-1)(S(y)+4)+y in this example, and found that the F_4 is different from the tree in this paper. After reading the code
trees_rectangle_f_delta.cc in this repository, I find that the tree in appendix F.1 is constructed by funtion S(S^(-1)(y)+4)+y instead of S^(-1)(S(y)+4). I wonder if I misunderstand the example, in other words, F_4(y) = S(S^(-1)(y)+4)+y but not S^(-1)(S(y)+4)+y in this example.
There may be a typo in appendix F.1, x + x' = F_delta(x + k).