| Autor: |
Rahul Girme, Raghvendra Rohit, Santanu Sarkar |
| Jazyk: |
angličtina |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Scientific Reports, Vol 14, Iss 1, Pp 1-18 (2024) |
| Druh dokumentu: |
article |
| ISSN: |
2045-2322 |
| DOI: |
10.1038/s41598-024-69361-z |
| Popis: |
Abstract We introduce augmented vector spaces of output differences, new generic and black-box distinguishers for Substitution Permutation Network (SPN) ciphers. Our distinguishers are based on a novel method of constructing a vector of size $$n^{(d)}$$ n ( d ) bits from a given vector of size n bits, where $$n^{(d)} = \sum _{i = 1}^{d}\left( {\begin{array}{c}n\\ i\end{array}}\right) $$ n ( d ) = ∑ i = 1 d n i and d is a positive integer. We list all such $$n^{(d)}$$ n ( d ) -bit vectors into a set called the corresponding $$d^{th}$$ d th -order augmented set and define its linear span as the corresponding $$d^{th}$$ d th -order augmented vector space . These sets are related to Reed-Muller codes and we prove that the rank of linear span of $$d^{th}$$ d th -order augmented set is $$n^{(d)}$$ n ( d ) using Reed-Muller codes. We then experimentally estimate the number of n-bit vectors required to span augmented vector spaces of output differences. Following these results, we give a generic and efficient algorithm to compute $$d^{th}$$ d th -order augmented vector space (of difference sets) for substitution permutation network ciphers. We apply our algorithm to lightweight ciphers GIFT, PRESENT and SKINNY and provide in-depth comparison of round-reduced ciphers’ distinguishers with random sets. Most notably, our new distinguishers for these ciphers cover more rounds than the subspace trails. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
