Figure 1 from Math-Net.Ru All Russian mathematical portal | Semantic Scholar (2024)

Using a set of formalisms, a mathematical model has been developed, which will make it possible to search for optimal solutions based on the criterion of economic efficiency and will find application not only in transport problems but also in many industries and economic activities.

This paper presents a practical fault analysis attack on Rabbit, a high speed scalable stream cipher with 128-bit key and a 64-bit initialization vector, in which the attacker is assumed to be able to fault a random bit of the internal state of the cipher but cannot control the exact location of injected faults.

A study of several fault attacks against the block cipher IDEA, which is the first Differential Fault Analysis of IDEA to the best of the authors' knowledge, recovers 93 out of 128 key bits exploiting about only 10 faults.

The differential fault attack technique is able to break the AES-128 with only 2 faulty ciphertexts, assuming the fault occurs between the antepenultimate and the penultimate MixColumn; this is better than the previous fault attacks against AES.

The security of GOST against side-channel attacks is examined with algebraic fault analysis (AFA), which combines the algebraic cryptanalysis with the fault attack and proves that keeping some components in a cipher secret cannot guarantee its security against fault attacks.

This paper proposes a chosen plaintext FIRE attack based on ineffective fault analysis (IFA) in the "byte stuck at 0" fault model and describes a step-by-step procedure that recovers the AES-like secret parameters without requiring the knowledge of the encryption key.

Two different DFA attacks on the AES are described: the first uses a fault model that induces a fault on only one bit of an intermediate result, hence allowing us to obtain the key by using 50 faulty ciphertexts for an AES-128, and the second uses a more realistic fault model, which assumes that a whole byte may be induced.

This paper shows the first single-key attack, which works for all key classes, on the full GOST block cipher, using a new attack framework called Reflection-Meet-in-the-Middle Attack and uses additional novel techniques which are the effective MITM techniques using equivalent keys on a small number of rounds.

This work states that this attack is applicable only to public key cryptosystems such as RSA, and not to secret key algorithms such as the Data Encryption Standard (DES).

A new fixed point property is introduced and a better way to attack 8-round GOST in order to find improved attacks on full GOST, which can be reduced from an impractical 264 to a practical 236 without changing the 2224 time complexity.

A differential fault attack that can be applied to the AES using a single fault, which demonstrates that when a single random byte fault is induced at the input of the eighth round, the AES key can be deduced using a two stage algorithm.

...

...