Nonlinear degree of Ascon permutation

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...

Full description

Saved in:
Bibliographic Details
Main Author: Victor Ruzhentsev
Format: Article
Language:English
Published: Polish Academy of Sciences 2025-06-01
Series:International Journal of Electronics and Telecommunications
Subjects:
Online Access:https://journals.pan.pl/Content/135267/17-4881-Ruzhentsev-sk.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849472232673247232
author Victor Ruzhentsev
author_facet Victor Ruzhentsev
author_sort Victor Ruzhentsev
collection DOAJ
description 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.
format Article
id doaj-art-013bd8a00f6b48bc950ede6853c9e7b6
institution Kabale University
issn 2081-8491
2300-1933
language English
publishDate 2025-06-01
publisher Polish Academy of Sciences
record_format Article
series International Journal of Electronics and Telecommunications
spelling doaj-art-013bd8a00f6b48bc950ede6853c9e7b62025-08-20T03:24:36ZengPolish Academy of SciencesInternational Journal of Electronics and Telecommunications2081-84912300-19332025-06-01vol. 71No 2477482https://doi.org/10.24425/ijet.2025.153594Nonlinear degree of Ascon permutationVictor Ruzhentsev0Kharkiv National University of RadioelectronicsAn 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.https://journals.pan.pl/Content/135267/17-4881-Ruzhentsev-sk.pdfpermutation of asconnonlinear degreenonlinear degree of substitutionzero-sum distinguisher
spellingShingle Victor Ruzhentsev
Nonlinear degree of Ascon permutation
International Journal of Electronics and Telecommunications
permutation of ascon
nonlinear degree
nonlinear degree of substitution
zero-sum distinguisher
title Nonlinear degree of Ascon permutation
title_full Nonlinear degree of Ascon permutation
title_fullStr Nonlinear degree of Ascon permutation
title_full_unstemmed Nonlinear degree of Ascon permutation
title_short Nonlinear degree of Ascon permutation
title_sort nonlinear degree of ascon permutation
topic permutation of ascon
nonlinear degree
nonlinear degree of substitution
zero-sum distinguisher
url https://journals.pan.pl/Content/135267/17-4881-Ruzhentsev-sk.pdf
work_keys_str_mv AT victorruzhentsev nonlineardegreeofasconpermutation