 Hello! Thanks for clicking on our little teaser video. I'm Katerina and this is Joint Work with Eril Gachon and Alice Poulémarie, both from Bordeaux. The title of our paper is some easy instances of the ideal shortest vector problem and applications on the Paje-Rondemonde knapsack problem. In the following I will try to highlight the contributions in form of pictures. I hope you enjoy it and hopefully we meet at Crypto. Okay, so let's get started with the first part of our contribution. Regarding the shortest vector problem on ideal lettuces. To cool down a little bit in this hot summer, let's imagine that the hardness of the shortest vector problem on ideal lettuces is represented by a big frozen lake. And in order to do cryptography, we need that the ice is very thick. It's a very hard problem. Whereas in general lettuces, we strongly believe that this is the case on the whole surface. In the case of ideal lettuces, the situation is a little bit different. So there have been previous works, the three holes here, that show that there are specific instances that are easy to solve. Whereas most of the holes, so the two holes that I have on the left and on the bottom, are very easy to verify in the sense that if you give me an ideal lettuces, I can easily tell you if it falls into the hole or not. The situation was a little bit more complex in the case of the right hole or puddle. So there have been two works by Pan and co-authors and Porter and co-authors, where they show that if the ideal lettuces has many symmetries, then the problem can be solved easier. So the first contribution of us is that we generalize their results and now it works for all number fields and any ideal lettuces whose prime factors are not ramified. So the puddle got a little bit bigger and I think that is even more important is that we give very simple conditions to verify whether an ideal lettuces falls into this hole or not. So we put this warning sign here. So now people can safely walk on the frozen lake of the ideal SVP problem. Okay, let's move on to the second part of our paper regarding the partial Vandermeer-Labsack problem. Without telling you what exactly this problem is, the only thing that you need to know for the picture is that it does define a problem on ideal lettuces and so we have to put it somewhere on this frozen lake. The second thing is there are different design choices of this problem and so there are actually different knapsacks on different places on this lake. And now comes the second big contribution of our paper is that we show that there are bad instances of the partial Vandermeer-Labsack problem that exactly fall into this hole that we made bigger in our first contribution. And here it's relevant to see that the fact that we made the hole bigger and we had this very clear and easy conditions to verify are necessary to see that instances of the partial Vandermeer-Labsack problem fall into it. And yeah, so these were the two contributions. Now I would like to finish with some disclaimers. The first thing is don't panic. There is still much surface on this frozen lake without any holes. And even if all the ice would be gone one day, most lattice-based cryptography, and particularly the one that is based on ring and module learning with ours, would not be impacted. So even if we would have an algorithm that solves the shortest vector problem on any ideal lattice, this does not give us an algorithm that solves ring or module learning with ours. Regarding partial Vandermeer-Labsack, a random instance has a good chance not to fall into the hole. And for more details, check out the long presentation on Tuesday or read our paper, which you can find on e-print.