@ARTICLE{Ruzhentsev_Victor_Nonlinear_2025,
 author={Ruzhentsev, Victor},
 volume={vol. 71},
 number={No 2},
 journal={International Journal of Electronics and Telecommunications},
 pages={477-482},
 howpublished={online},
 year={2025},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={An estimation of the nonlinear degrees for the forward and inverse permutations of the Ascon algorithm is made in this work. This estimation is made by analyzing higher order differentials. The obtained results of nonlinear degree are significantly lower than the known data. Instead of the generally accepted values sr (where s is nonlinear degree of substitution and r is number of rounds), the computational experiments demonstrated the value s(r-1)+1 in all the considered cases. These results allow to clarify the complexity of constructing the best known distinguisher - the zero-sum distinguisher - for a multiround transformations. Thus, instead of the known complexity values of 285 and 2130 for 11 and 12 rounds of transformations, according to our data, the complexity for 11 rounds is 235 and for 12 rounds is 270.},
 type={Article},
 title={Nonlinear degree of Ascon permutation},
 URL={http://ochroma.man.poznan.pl/Content/135267/17-4881-Ruzhentsev-sk.pdf},
 doi={10.24425/ijet.2025.153594},
 keywords={Permutation of Ascon, Nonlinear degree, Nonlinear degree of substitution, Zero-sum distinguisher},
}