 Okay, so a while ago when I started my PhD, I attended the workshop in Leida and then at the lunch I sat opposite to Jo and Dame and after I introduced and told him I'm doing symmetric crypt analysis, he told me, ah, so you're also a bit fucker. And then I went back to my hotel room and I was like, well, I looked at myself, I looked at the work I was doing and I actually didn't really see the bits, I only saw cycles on permutation and at the start of my PhD I did some work on this, I looked at the structure in permutations and what I found out is that it's really well known how to find very small cycles, like one cycle, fixed points and it's also quite trivial to find really big cycles. Well, you can just, like, if you want to find a fixed point, you just take a step forward, look, have I been here before or is this where I come from? No, keep going till you find one and big cycle, you just pick a point, just keep on walking until you get back and with high probability that's a high cycle, a large cycle. So then the question was, what about the smaller cycles? And I looked into it and it was actually a bit harder and we looked into it how to find these things efficiently. We could shave off some constants, nothing very exciting and then we asked some people like, hey, do you know how this works and we have this problem and they said that it's a really nice problem but why, what are the applications and I had to think a long time and most of the applications I could find is distinguishing between different families of presentations like SNS squared and improvements in the types of slide attacks but that's all I could find so if anyone knows something, please contact me, talk to me, give me a beer, I'll need it. Thanks.