Evaluation of the maximum performance of block encryption algorithms

2019 ◽  
Vol 10 (2) ◽  
pp. 181-191
Author(s):  
Vladimir Mikhailovich Fomichev ◽  
Alisa Mikhailovna Koreneva ◽  
Al'finur Ruslanovna Miftakhutdinova ◽  
Dmitrii Igorevich Zadorozhny
Keyword(s):  
Maximum Performance ◽  
Encryption Algorithms ◽  
Block Encryption

Исследуется класс нелинейных итеративных преобразований, обобщающих сеть Фейстеля и построенных на основе автономного регистра сдвига длины $n$ с $m$ обратными связями над множеством $32$-мерных двоичных векторов, $32 \geqslant n > m \geqslant 1$. Предложена интегральная характеристика предельной производительности шифрования, которая может применяться при обосновании выбора параметров конкретных блочных алгоритмов.

DYNAMIC SUBSTITUTION BOXES OF SYMMETRIC BLOCK ENCRYPTION ALGORITHMS

2021 ◽  
Vol 75 (3) ◽  
pp. 115-120
Author(s):  
N.A. Kapalova ◽  
◽  
A. Haumen ◽  
Keyword(s):  
Differential Cryptanalysis ◽  
New Method ◽  
Secret Key ◽  
Substitution Box ◽  
Nonlinear Transformations ◽  
Substitution Boxes ◽  
Encryption Algorithms ◽  
Block Algorithms ◽  
Symmetric Block ◽  
Block Encryption

The paper deals with nonlinear transformations of well-known symmetric block algorithms such as AES, Kuznyechik, SM4, BelT, and Kalyna. A brief description of the substitution boxes for these algorithms is given. The properties of nonlinearity of the described substitution boxes are investigated with the calculation of the corresponding values. Based on the property of nonlinearity, a method for generating a dynamic substitution box is proposed. The purpose of this method is to generate dynamic substitution boxes (S-boxes) that change depending on the values of some parameter obtained from the secret key of the algorithm. Considering that linear and differential cryptanalysis uses known substitution boxes, the main advantage of the new method is that S-boxes are randomly key-dependent and unknown. Experiments were also carried out to implement this method. The resulting dynamic substitution boxes were tested for nonlinearity and the results were compared with the original nonlinearity values of the same substitution boxes.

scholarly journals Analysis of block encryption algorithms being used in devices with restricted amount of technological possibilities

2020 ◽  
Vol 224 ◽  
pp. 01043
Author(s):  
Larissa Cherckesova ◽  
Olga Safaryan ◽  
Pavel Razumov ◽  
Dmitry Medvedev ◽  
Veronica Kravchenko ◽  
...  
Keyword(s):  
Comparative Analysis ◽  
National Security ◽  
Encryption Algorithm ◽  
National Security Agency ◽  
Encryption Algorithms ◽  
Lightweight Encryption ◽  
Block Encryption

This report is devoted to the comparative analysis of the lightweight NASH block encryption algorithm and the algorithm presented by USA National Security Agency in 2013 – SPECK. Their detailed description is given, the analysis is made. The task of the study is to investigate and analyze cryptographic encryption algorithms used in devices with limited capabilities such as microcontrollers. The study of lightweight encryption algorithms and their application for cybersecurity tasks is necessary to create the latest cryptographic systems aimed at preventing various types of attacks. The study revealed that the NASH block encryption algorithm showed more optimized performance, since the number of rounds of cipher execution is less than that Speck algorithm, which provides greater stability of algorithm with least number of executable rounds.

scholarly journals Optimizing the performance of block encryption algorithms

2017 ◽  
Author(s):  
Vladislav Eduardovich Pavlov ◽  
◽  
Valery Anatolievich Udaltsov ◽  
Keyword(s):  
Encryption Algorithms ◽  
Block Encryption

A Novel Lightweight Block Encryption Algorithm Based on Combined Chaotic S-Box

2021 ◽  
Vol 31 (10) ◽  
pp. 2150152
Author(s):  
Xiaojun Tong ◽  
Xudong Liu ◽  
Jing Liu ◽  
Miao Zhang ◽  
Zhu Wang
Keyword(s):  
Chaotic Map ◽  
Computational Cost ◽  
Encryption Algorithm ◽  
Encryption Algorithms ◽  
Complexity Of Algorithm ◽  
Algorithm Implementation ◽  
High Computational Cost ◽  
Feistel Structure ◽  
Independence Criterion ◽  
Block Encryption

Due to high computational cost, traditional encryption algorithms are not suitable for the environments in which resources are limited. In view of the above problem, we first propose a combined chaotic map to increase the chaotic interval and Lyapunov exponent of the existing one-dimensional chaotic maps. Then, an S-box based on the proposed combined chaotic map is constructed. The performances of the designed S-box, such as bijection, nonlinearity, strict avalanche criteria, differential uniformity, the bits independence criterion, and the linear approximation probability, are tested to show that it has better cryptographic performances. Finally, we present a lightweight block encryption algorithm by using the above S-box. The algorithm is based on the generalized Feistel structure and SPN structure. In addtion, the processes of encryption and decryption of our algorithm are almost the same, which reduces the complexity of algorithm implementation. The experimental results show that the proposed encryption algorithm meets the requirements of lightweight algorithms and has good cryptographic characteristics.

How to Add the Integrity Checking Capability to Block Encryption Algorithms

2006 ◽  
Author(s):  
R. Elbaz ◽  
L. Torres ◽  
G. Sassatelli ◽  
P. Guillemin ◽  
M. Bardouillet ◽  
...  
Keyword(s):  
Integrity Checking ◽  
Encryption Algorithms ◽  
Block Encryption
Sign in / Sign up

Export Citation Format

Share Document