On the possibility of modifying the KB-256 algorithm from the searching for impossible differentials view point
Prikladnaâ diskretnaâ matematika, no. 1 (2025), pp. 70-79
Voir la notice de l'article provenant de la source Math-Net.Ru
The presence of impossible differentials in a block cipher algorithm can lead to efficient methods for recovering the secret key. A large number of impossible differentials have been found for the KB-256 algorithm. This paper considers the modification of the feedback function to reduce the number of iterations to which they can be extended. A general approach to finding differences with probability 1 is proposed. It is shown that changing the number of summable sub-blocks in the feedback function will not reduce the maximum number of iterations to which an infeasible differential can be extended.
@article{PDM_2025_1_a3,
author = {A. B. Chuhno},
title = {On the possibility of modifying the {KB-256} algorithm from the searching for impossible differentials view point},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {70--79},
publisher = {mathdoc},
number = {1},
year = {2025},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2025_1_a3/}
}
TY - JOUR AU - A. B. Chuhno TI - On the possibility of modifying the KB-256 algorithm from the searching for impossible differentials view point JO - Prikladnaâ diskretnaâ matematika PY - 2025 SP - 70 EP - 79 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDM_2025_1_a3/ LA - ru ID - PDM_2025_1_a3 ER -
A. B. Chuhno. On the possibility of modifying the KB-256 algorithm from the searching for impossible differentials view point. Prikladnaâ diskretnaâ matematika, no. 1 (2025), pp. 70-79. http://geodesic.mathdoc.fr/item/PDM_2025_1_a3/