Work

On the Possibility of Modifying the Kb-256 Algorithm From the Searching for Impossible Differentials View Point

Year: 2025

Type: article

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

Source: PRIKLADNAYa DISKRETNAYa MATEMATIKA

DOI: 10.17223/20710410/67/3

Author: A. B. Chuhno

Institution: National Research University Higher School of Economics

Language: English

Topic: Cryptographic Implementations and Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4408924543

FWCI:

Cites:

Cited by:

Related to: 10