 Hello, everyone. It's my pleasure to give a presentation here. My name is Xi Xiaohu. I'm a student of the Institute of Information Engineering, Chinese Academy of Sciences. In our paper, we research the propagation of this, and propose a new automatic search total for impossible differentials and impossible as far as one possible traditions. The content for this presentation is divided into six parts. First, we recall some information of traditional impossible differentials and impossible as far as one possible traditions. Then, we refine those two digital wishers. Next, we study the relations between our new defined digital wishers and traditional definitions. For the more, we present our automatic search total for those two digital wishers, and we apply our total to various black circles. Finally, I will make a conclusion. Impossible differential is a digital wisher of impossible differential circumstances, which is used to discuss the wrong case to recall the right case. Usually, a part of input and output difference alpha-beta is called an impossible differential from alpha. It means that, according to the propagation of difference, the input difference alpha can propagate to the output difference beta through alpha. There are already some automatic search tools for impossible differentials, however, those methods have the following limitations. They can't take account of the case schedule in the single case setting. They can't consent to the differential property of not as false. They can't be applied to the black circles with variable rotation. Impossible as far as one possible tradition is a digital wisher of impossible as far as one possible interpretation. Usually, a part of input and output difference alpha-beta is called an impossible as far as one possible interpretation of a formula as well. It means that, according to the propagation of a difference, the input difference alpha can propagate to the output difference beta. In other words, the impossible differential is a substantial case of impossible as far as one possible interpretation when asked in code 1. For the automatic search tools, only the same proposal 1. However, this method can only be confirmed to a small number of rounds. Meanwhile, this method can't take account of the case schedule in the single case setting and can't be applied to the black circles with variable rotation, who break up all the limitations of those automatic search tools. Very simple were the limitations of those tools to distinguish the first. Actually, a single alpha-beta is an impossible differential of a formula as far as one possible interpretation. Then, for all k, x, and y, the total fs, fs, and r alpha, not equal to the total y, y, y, or beta, this is similarly for impossible as far as one possible interpretation. Thus, for those tools to distinguish us, it is important to distinguish the relations between some inputs of this and outputs of this. For one input of this as 0, after the first round input question, this is e1, k1, and 0. After the first round input question, this is er, k, and 0. This is similarly for this as 1, until this as x, as minus 1. Since we want to research the relation of some states in different rounds, we put this in each round together and define such a structure as as polygon. That is a couple with s elements. Then, the s-partisanal protocol is round by round, which forms an r-round s-partisanal trail. Moreover, if the round case are chosen independently, then such a trail is called a r-round s-partisanal trail. If the round case are chosen according to the case schedule, such a trail is called a r-round d-s-partisanal trail. Based on the definition of s-partisanal trail, we can define the possible as-partigans and impossible as-partigans according to the compatibility of as-partigans actually. If the two as-partigans are compatible, they are called possible as-partigans. Moreover, if the round case are chosen independently, they are called as possible as-partigans. If the round case are chosen according to the case schedule, they are called the impossible as-partigans. If the two as-partigans are incompatible, they are called impossible as-partigans. Moreover, if the round case are chosen independently, they are called as impossible as-partigans. If the round case are chosen according to the case schedule, they are called the impossible as-partigans. Now we find the impossible as possible as possible as possible. The parallel input and output accelerance are per beta, it called an around at impossible as possible as possible. We call the input and output as per one products as well, which satisfies the parallel input and output accelerance as per beta as well as around at impossible as possible. The part of the input and output S-severance alpha-beta is called an around-the-impossible S-pass-1 polytopic situation, where the part of the input and output S-pass-1 polygons X, Y, which satisfies the part of the input and output S-severance alpha-beta X, Y, R, around-the-impossible S-pass-1 polygons, known as ETA. The definitions are also used for the impossible differential with S-1. In the next, we study the variations based on new definitions and the traditional definitions. Actually, the unimpossible S-pass-1 polytopic representation and the traditional definitions are equivalent for SPN structure, FISL structure, and the browser for MR-1. The advantage is that, based on the equivalence, our definitions do new view of traditional definitions, allow us to get the impossible differential and impossible S-pass-1 polytopic traditions for browser for MR-1 as well, by using full knowledge of the differential or S-severance property. Finally, we design a set-up-based tool to search our new defined distinct features. Set-up program is a class silent-tapile-commutating program. Even to determine whether the current booting formula has a solution or not, STGP is a set-up tool, which supports the CVC format as the file-based input format. For a set-up program, STGP has two possible outputs, VVDA, which means the set-up program has not a solution. In VVDA, and a solution of the set-up program, which means the set-up program has a solution. The method for booting the propagation of data through each operation as follows. For generalized copy, it can be moved by. For generalized SOR, it can be moved by. Verbure SOR is the LHR function of STGP. For generalized meter addition, it can be moved by. Verbure pass is the meter addition function of STGP. For binary matrix multiplication, STGP can be replaced in the other. Thus, the model method for it can be deduced from copy and generalized SOR. STGP is also the terminal term. That is, the determinant of FAA, ZNB, SC, and A4. Verbure A is a blue term, and BNC are particular terms. Actually, this term will allow us to achieve the loop-out-of-table function. Thus, we can model the propagation of data through SBOX, variable rotation, and key development permission. As the propagation of data through those operations can be referenced as loop-out-of-table. Based on those loading methods, we propose a method to determine whether a powerful input and output S-differentiated alpha-beta is the impossible S-plus-1 polytopic translation or not. The method can be divided into two phases, the sediments-generated phase, and the SCP-invocated phase. In the sediments-generated phase, we generate a series-term of sediments as a file to decryberate the input S-plus-1 polygon propagate to the output S-plus-1 polygon. Where the input S-plus-1 polygon satisfies the input S-differentiated alpha, and the output S-plus-1 polygon satisfies the output S-differentiated beta. The algorithm is detailed as follows. In line 34, we declare the variables which are used in the series-term of sediments, including the variables which are used to represent the input S-plus-1 polygon and output S-plus-1 polygon. The intermediate variables and the key variables used to decryber the propagation from the input S-plus-1 polygon to the output S-plus-1 polygon. In line 507, according to the propagation of each operation, we model the propagation from the input S-plus-1 polygon X to the output S-plus-1 polygon Y with the add of the intermediate variables and key variables. In line 829, we generate the sediments in CVC format such that the input S-plus-1 polygon X satisfies the input S-differentiated alpha, and the output S-plus-1 polygon Y satisfies the output S-differentiated beta. In line 10225, we set the key flag at the draw. Then the algorithm generates the sediments to construct the key variables according to the key schedule. In this case, the algorithm generates the sediments to determine whether a paragraph input and output S-differentiated alpha-beta is an around D impossible S-plus-1 polytopic transition. Otherwise, it generates the sediments to determine whether a paragraph input and output S-differentiated alpha-beta is an around I impossible S-plus-1 polytopic transition. In line 13, the sediments called false and counter example are added to the sediments. This is a common method in STP to determine whether a set program has a solution by adding those two sediments. If the setup program has a solution, the STP will return one of the solution and the sediments in VWID. Otherwise, it returns VWID. In the STP invoke interface, we invoke STP for the file. If we set the key flag at the draw and STP returns VWID, then alpha-beta is the D impossible S-plus-1 polytopic transition. If we set the key flag as false and STP returns VWID, then alpha-beta is the I impossible S-plus-1 polytopic transition. Our total can also work as a proof of total. Once the search space fits, we can run our total for input and output as differences in search space. If no one of the input and output as differences is an around I impossible or D impossible S-plus-1 polytopic transition, we can declare that there is no around I impossible or D impossible S-plus-1 polytopic transition in this search space. As a result, we apply our total to various block servers. Those results can be divided into three s-piles. In the s-piles of drawing new impossible differential, we apply our total to KFTA, printer server, mc1, and rc5. For KFTA, we set the impossible differential in the case of conceding the case schedule in a single case setting, and we get two, six wrongs impossible differential. Those impossible differential can't be detected by previous measures. For printer server, we propose the false modeling method for K dependent formation, and such impossible differential in the case of conceding all the details of case schedule. For mc1, our total can conceding all the differential property of s-piles for rc5. We represent the false modeling method for variable rotation, and get the false result of impossible differential. In the aspect of evaluating the resistance against the impossible differential, our total can be applied to evaluate the security of light-weight block servers against impossible differential in the case of conceding the case schedule in a single case setting. As the direct application, we apply our total to KFTA, present, mid-order, and printer server. In the third space, where the input difference only actives 1 s-piles in the first sub-state solution, and the output difference only actives 1 s-piles in the last sub-state solution, and in the case of conceding the case schedule in the single case setting, the tight bond in which no impossible differential exists is 7, 7, 6, 5, and 6. Moreover, we propose the surface technique to speed up the process of approval. That is, if we want to approve all the input difference and output difference in the third space, a, b are possible differentials, then we can choose data i and data o, such that the number of elements in data i is less than the number of elements of a, and the number of elements of data o is less than the number of elements of b, and prove all the input and output differences in the third space data i data o are possible differentials. With this technique, we propose that, even conceding the relation of metals around the case, there are still exist no 5-round 1-input active order, and 1-output active order impossible differentials for a, s. Besides, we also propose the inside volume technique to speed up the process of approval. That is, proving alpha-beta is the i-possible differential, or d-possible differential, may be time-consuming. Thus, we can prove that 0-alpha and 0-beta are i-possible two-paragrants, or d-possible two-paragrants. With this technique, we propose that there exist no 1-input active bits, and 1-output active bits are impossible differentials for a 5-round misty 1, with the F5 layers placed as the event rounds. In the aspect of resulting in new impossible s-plus-1 polytopic transition, we apply our total for-gift point-surfer as a 5 and a present for-gift, with such the impossible 3-polytopic transition in the case of transcending the case schedule in the single-case setting for-print-surfer, with such the impossible 3-polytopic transition and 4-polytopic transition in the case of transcending the case schedule in the single-case setting for as a 5 and a present, with such the impossible 3-polytopic In the case of the run-to-case are chosen independently from the table, as can be said. All the digital visuals we get can cover more than their corresponding impossible differentials. In this table, we manage the propagation of this and propose a new automatic set total for impossible differentials and impossible as possible and protocol-driven. We apply our total to various browser servers and get some new results. To show the interesting results, we put the distinctive visuals of some browser servers together as shown in the table. With the increase of commercial ads, the number of runs in which the impossible as possible and protocol-driven exists also increases. For example, the run-to-case of impossible differentials, impossible 3-point protocol transitions, and impossible 4-point protocol transitions of printer server 48 are 4, 6, and 7. Although due to the limitation of computer power, we can only search with small s. This may burden some ads in the future. Thank you for your attention.