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 Efficient Chaos-Based Substitution-Box and Its Application to Image Encryption

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1392
Author(s):  
Ahmed A. Abd El-Latif ◽  
Bassem Abd-El-Atty ◽  
Akram Belazi ◽  
Abdullah M. Iliyasu
Keyword(s):  
High Performance ◽  
Chaotic Systems ◽  
Chaotic Map ◽  
Input Image ◽  
Gray Codes ◽  
Secret Key ◽  
Substitution Box ◽  
3 Dimensional ◽  
Substitution Boxes ◽  
Image Cryptosystem

Chaotic systems are vital in designing contemporary cryptographic systems. This study proposes an innovative method for constructing an effective substitution box using a 3-dimensional chaotic map. Moreover, bouyed by the efficiency of the proposed chaos-based substitution boxes’ effectiveness, we introduce a new chaos-based image cryptosystem that combines the adeptness of Gray codes, a non-linear and sensitive hyper-chaotic system, and the proposed S-box. The generated secret key emanating from the cryptosystem is correlated to the input image to produce a unique key for each image. Extensive experimental outcomes demonstrate the utility, effectiveness, and high performance of the resulting cryptosystem.

scholarly journals SITM: See-In-The-Middle Side-Channel Assisted Middle Round Differential Cryptanalysis on SPN Block Ciphers

2019 ◽  
pp. 95-122
Author(s):  
Shivam Bhasin ◽  
Jakub Breier ◽  
Xiaolu Hou ◽  
Dirmanto Jap ◽  
Romain Poussier ◽  
...  
Keyword(s):  
Block Cipher ◽  
State Of The Art ◽  
Block Ciphers ◽  
Differential Cryptanalysis ◽  
Side Channel ◽  
Secret Key ◽  
Side Channel Analysis ◽  
Cryptographic Algorithms ◽  
Channel Analysis ◽  
Symmetric Block

Side-channel analysis constitutes a powerful attack vector against cryptographic implementations. Techniques such as power and electromagnetic side-channel analysis have been extensively studied to provide an efficient way to recover the secret key used in cryptographic algorithms. To protect against such attacks, countermeasure designers have developed protection methods, such as masking and hiding, to make the attacks harder. However, due to significant overheads, these protections are sometimes deployed only at the beginning and the end of encryption, which are the main targets for side-channel attacks.In this paper, we present a methodology for side-channel assisted differential cryptanalysis attack to target middle rounds of block cipher implementations. Such method presents a powerful attack vector against designs that normally only protect the beginning and end rounds of ciphers. We generalize the attack to SPN based ciphers and calculate the effort the attacker needs to recover the secret key. We provide experimental results on 8-bit and 32-bit microcontrollers. We provide case studies on state-of-the-art symmetric block ciphers, such as AES, SKINNY, and PRESENT. Furthermore, we show how to attack shuffling-protected implementations.

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$. Предложена интегральная характеристика предельной производительности шифрования, которая может применяться при обосновании выбора параметров конкретных блочных алгоритмов.

scholarly journals Key Generation based on Henon map and Lorenz system

2020 ◽  
Vol 31 (1) ◽  
pp. 41
Author(s):  
Ansam Sabah Bader ◽  
Shaymaa Hameed ◽  
Maisa’a Abid Ali K.
Keyword(s):  
Lorenz System ◽  
New Method ◽  
Key Generation ◽  
Hénon Map ◽  
Henon Map ◽  
Data Authentication ◽  
Secure Information ◽  
Data Store ◽  
Significant Process ◽  
Encryption Algorithms

Securing information has been the most significant process for communication and data store. Orderly to secure information such as data authentication,  data integrity, and confidentiality must be verified based on algorithms of cryptography. Where, the most important part of any encryption algorithms is the key which specifies if the system is strong enough or not. The proposal of this paper is a new method to generate keys based on two kinds of chaos theory in order to improve the security of cryptographic algorithms. The base of this proposal is to investigate a new method for generating random numbers by using the 3D Lorenz system and 2D Henon map. The newly generated keys have successfully passed the National Institute of Standards and Technology (NIST) statistical test suite

scholarly journals A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †

Information ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 133
Author(s):  
Arnaud Sipasseuth ◽  
Thomas Plantard ◽  
Willy Susilo
Keyword(s):  
Uniform Distribution ◽  
Random Noise ◽  
Theoretical Framework ◽  
New Method ◽  
Signature Scheme ◽  
Secret Key ◽  
Initial Work ◽  
Dimensional Ball ◽  
Diagonal Reduction

At PKC 2008, Plantard et al. published a theoretical framework for a lattice-based signature scheme, namely Plantard–Susilo–Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DRS) scheme was presented in the National Institute of Standards and Technology (NIST) PQC Standardization as a concrete instantiation of the initial work. Unfortunately, the initial submission was challenged by Yu and Ducas using the structure that is present on the secret key noise. In this paper, we are proposing a new method to generate random noise in the DRS scheme to eliminate the aforementioned attack, and all subsequent potential variants. This involves sampling vectors from the n-dimensional ball with uniform distribution. We also give insight on some underlying properties which affects both security and efficiency on the PSW type schemes and beyond, and hopefully increase the understanding on this family of lattices.

scholarly journals An Algorithm of Image Encryption Using Logistic and Two-Dimensional Chaotic Economic Maps

Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 44 ◽  
Author(s):  
Sameh Askar ◽  
Abdel Karawia ◽  
Abdulrahman Al-Khedhairi ◽  
Fatemah Al-Ammar
Keyword(s):  
Image Encryption ◽  
Security Level ◽  
Two Dimensional ◽  
Secret Key ◽  
Large Space ◽  
Cryptographic Algorithm ◽  
Key Space ◽  
Contrast Analysis ◽  
Encryption Algorithms ◽  
Made In

In the literature, there are many image encryption algorithms that have been constructed based on different chaotic maps. However, those algorithms do well in the cryptographic process, but still, some developments need to be made in order to enhance the security level supported by them. This paper introduces a new cryptographic algorithm that depends on a logistic and two-dimensional chaotic economic map. The robustness of the introduced algorithm is shown by implementing it on several types of images. The implementation of the algorithm and its security are partially analyzed using some statistical analyses such as sensitivity to the key space, pixels correlation, the entropy process, and contrast analysis. The results given in this paper and the comparisons performed have led us to decide that the introduced algorithm is characterized by a large space of key security, sensitivity to the secret key, few coefficients of correlation, a high contrast, and accepted information of entropy. In addition, the results obtained in experiments show that our proposed algorithm resists statistical, differential, brute-force, and noise attacks.

A Novel Algorithm for Block Encryption of Digital Image Based on Chaos

2011 ◽  
Vol 5 (1) ◽  
pp. 59-74 ◽  
Author(s):  
Jun Peng ◽  
Du Zhang ◽  
Xiaofeng Liao
Keyword(s):  
Three Dimensional ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Secret Key ◽  
Image Block ◽  
Differential Attack ◽  
Avalanche Effect ◽  
Chaotic Dynamical System ◽  
Key Space ◽  
Block Encryption

This paper proposes a novel image block encryption algorithm based on three-dimensional Chen chaotic dynamical system. The algorithm works on 32-bit image blocks with a 192-bit secret key. The idea is that the key is employed to drive the Chen’s system to generate a chaotic sequence that is inputted to a specially designed function G, in which we use new 8x8 S-boxes generated by chaotic maps (Tang, 2005). In order to improve the robustness against differental cryptanalysis and produce desirable avalanche effect, the function G is iteratively performed several times and its last outputs serve as the keystreams to encrypt the original image block. The design of the encryption algorithm is described along with security analyses. The results from key space analysis, differential attack analysis, and information entropy analysis, correlation analysis of two adjacent pixels prove that the proposed algorithm can resist cryptanalytic, statistical and brute force attacks, and achieve a higher level of security. The algorithm can be employed to realize the security cryptosystems over the Internet.

Sign in / Sign up

Export Citation Format

Share Document