 Good morning everyone. My name is Phuong. I'm from Nanyang Technological University in Singapore. I will present our paper, Chiang Blating Rebound Attack on AES, like passing. This is a joint work with Xiao Yang Dong from Tsinghua University, Yang Wu, Sun Li, and me from Singapore. The rebound attack was first introduced by mandate at all. Quick is an efficient way to satisfy the collision of pass function by fulfilling a heavy middle route or inbound path of differential path for free, utilizing the degree of freedom from the states. In the previous work, the inbound paths are found manually using the super-espoil technique, which can cover up to two routes. The best collision attack on AES is seven routes in quantum setting and up to six routes in classical setting. In this paper, we further developed the line of research on rebound attack by introducing super-inbound. Quick is the multiple inbound phases and can cover three to four routes in the middle. Using the fact that the attacker can freely choose the key in semi-free start collision attack, we utilize the degree of freedom from the key values to match the state values and automatically find the solution of inbound path by solving the system of equation of super-inbound with Tsinghua relation algorithm. This algorithm is an efficient way to solve the nonlinear system of equation. Quick input is a set of fixed variables, and it outputs the remaining three variables. We apply the new method to obtain the new semi-free start collision attack on AES like Hassing and especially the first sixth route semi-free start collision of AES 128 MMO is given. To describe the method, an example of seven route chill is given with the inbound path in figure one here. Assume that a valid differential characteristic is found for this chill. We can access to the differential distribution table to obtain the values of all 80 bytes in Y3, Y4 and Y5. The values of K4 and K5 are chosen carefully so that they have to match those no blue bytes. So since AES has a basis of 32 bytes, when 31 bytes in blue color are fixed here, the Tsinghua relation will have to find the last three bytes automatically. Quick is K512 in this case. All right, our results are presented in this table. With several, you can see that several of new attack on AES 128 MMO or MP and skinny hash are given. And we also improve several attacks on skinny hash and cluster. So details will be given in my talk on Monday 10 a.m. See you. Bye bye.