Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Nonlinear degree of substitution

Sortuj według:

Ogranicz wyniki do:

Nonlinear degree of Ascon permutation

Ruzhentsev Victor

International Journal of Electronics and Telecommunications

2025

Vol. 71, No. 2

477-482

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 multi-round 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 2⁷⁰.