Cryptographic Analysis Research Articles

Integral Cryptanalysis of Reduced-Round IIoTBC-A and Full IIoTBC-B

This paper delves into the realm of cryptographic analysis by employing mixed-integer linear programming (MILP), a powerful tool for automated cryptanalysis. Building on this foundation, we apply the division property method alongside MILP to conduct a comprehensive cryptanalysis of the IIoTBC (industrial Internet of Things block cipher) algorithm, a critical cipher in the security landscape of industrial IoT systems. Our investigation into IIoTBC System A has led to identifying a 14-round integral distinguisher, further extended to a 22-round key recovery. This significant finding underscores the cipher’s susceptibility to sophisticated cryptanalytic attacks and demonstrates the profound impact of combining the division property method with MILP in revealing hidden cipher weaknesses. In the case of IIoTBC System B, our innovative approach has uncovered a full-round distinguisher. We provide theoretical validation for this distinguisher and uncover a pivotal structural issue in the System B algorithm, specifically the non-diffusion of its third branch. This discovery sheds light on inherent security challenges within System B and points to areas for potential enhancement in its design. Our research, through its methodical examination and analysis of the IIoTBC algorithm, contributes substantially to the field of cryptographic security, especially concerning industrial IoT applications. By uncovering and analyzing the vulnerabilities within IIoTBC, we enhance the understanding of cipher robustness and pave the way for advancements in securing industrial IoT communications.

An efficient image encryption algorithm using a discrete memory-based logistic map with deep neural network

In the last few years, multimedia technology has made tremendous strides. These days, the Web is frequently used to transfer multimedia content, including audio, video, and photos. However, the Internet is a very vulnerable medium with many security holes. To ensure that multimedia content carried across unprotected channels, like the Internet, is secure and private, several encryption techniques have been proposed. New encryption strategies must be developed because multimedia data streams cannot be encrypted using traditional methods. Therefore, the main goal of the recommended system is to present an analytical research approach for introducing a sophisticated framework wherein the suggested encryption technologies' efficacy is increased through the use of deep neural networks (DNNs). The robustness of the DNN principle is coupled with a discrete memristor-based logistic chaotic map notion for enhanced security performance. In this paper, three distinct encryption algorithms—Arnie cat with an artificial neural network (ANN), Henon map with an ANN, and logistic map with a DNN—are compared for security and performance with the suggested algorithm. Correlation coefficients, information entropy, number of pixels changing rate (NPCR), encryption quality, and encryption duration are the cryptographic analysis parameters examined here. The results show that the recommended implementation enhances security performance without degrading image quality. The proposed algorithm achieves 35.9% of UACI, 99.95% of NPCR, and 7.997231 of entropy.

Cryptographic Analysis and Construction of Complete Permutations using a Recursive Approach

Cryptographic Analysis and Construction of Complete Permutations using a Recursive Approach

Hybrid Quantum Key Distribution Protocol with Chaotic System for Securing Data Transmission

This research proposes a combination of Quantum Key Distribution (QKD) based on the BB84 protocol with Improved Logistic Map (ILM) to improve data transmission security. This method integrates quantum key formation from BB84 with ILM encryption. This combination creates an additional layer of security, where by default, the operation on BB84 is only XOR-substitution, with the addition of ILM creating a permutation operation on quantum keys. Experiments are measured with several quantum measurements such as Quantum Bit Error Rate (QBER), Polarization Error Rate (PER), Quantum Fidelity (QF), Eavesdropping Detection (ED), and Entanglement-based detection (EDB), as well as classical cryptographic analysis such as Bit Error Ratio (BER), Entropy, Histogram Analysis, and Normalized Pixel Change Rate (NPCR) and Unified Average Changing Intensity (UACI). As a result, the proposed method obtained satisfactory results, especially perfect QF and BER, and EBD, which reached 0.999.

Construction of small confusion component based on logarithmic permutation for hybrid information hiding scheme

The design and development of secure nonlinear cryptographic Boolean function plays an unavoidable measure for modern information confidentiality schemes. This ensure the importance and applicability of nonlinear cryptographic Boolean functions. The current communication is about to suggest an innovative and energy efficient lightweight nonlinear multivalued cryptographic Boolean function of modern block ciphers. The proposed nonlinear confusion element is used in image encryption of secret images and information hiding techniques. We have suggested a robust LSB steganography structure for the secret hiding in the cover image. The suggested approach provides an effective and efficient storage security mechanism for digital image protection. The technique is evaluated against various cryptographic analyses which authenticated our proposed mechanism.

Design and optimization of nonlinear component of block cipher: Applications to multimedia security

Nowadays, various image encryption schemes based on chaotic systems have been developed, each of them has its own limitations and strength in terms of security and computational speed. The proposed image encryption scheme utilizes 2-D maps without disturbing their mathematical structure, characterized by topological features such as chaotic behavior and fractal properties, namely the Zaslavasky, Bakers, and Henon Maps. This approach utilizes both confusion and diffusion stages to achieve high levels of security against various attacks. The confusion stage utilizes chaotic values to muddle the rows and columns of the image, reducing the correlations between neighboring pixels, while the diffusion step achieves the avalanche effect with 2D Bakers map and Henon map. The proposed image encryption scheme is analyzed thoroughly to evaluate its security and performance. To evaluate the security and computational efficiency of the proposed image encryption method, various analysis such as correlation, contrast, entropy, energy, homogeneity, and performance analyses are conducted. Moreover, the three proposed S-boxes are also tested to evaluate their effectiveness using cryptographic analysis tests such as nonlinearity, strict Avalanche criterion, differential probability, linear probability, and bit independence criterion, which we also utilized in our proposed image encryption scheme.

Hybrid multi-criteria decision-making technique for the selection of best cryptographic multivalued Boolean function

Robustness of modern information confidentiality algorithm depends on its individual components. Modern block ciphers highly depend on two components namely confusion and diffusion. These two main characteristics in any modern cipher are achieved by substitution and permutation boxes. In this article, a decision-making algorithm is utilized for the selection of optimum substitution box (S-box), which plays a significant role in the field of information confidentiality. For this purpose, an interval-based Pythagorean fuzzy technique for order of preference by similarity to the ideal solution (IVPF–TOPSIS) method is introduced to get the desired nonlinear confusion component of block cipher namely S-box. In this manner, we performed cryptographic analyses of standard S-boxes namely nonlinearity (NL), strict avalanche criterion (SAC), bit-independent criterion (BIC), absolute indicator (ABI), the sum of square and absolute indicator (SSAI), algebraic degree (AD), algebraic immunity (AI), transparency order (TO), composite algebraic immunity (CAI), robustness (RB), signal to noise ratio (SNR), confusion coefficient of variance (CCV). With these cryptographic characteristics, we have used interval-valued based Pythagorean fuzzy TOPSIS multi-criteria decision-making technique to classify standard S-boxes suitable for construction of modern block ciphers.

TWo-IN-one-SSE: Fast, Scalable and Storage-Efficient Searchable Symmetric Encryption for Conjunctive and Disjunctive Boolean Queries

Searchable Symmetric Encryption (SSE) supports efficient yet secure query processing over outsourced symmetrically encrypted databases without the need for decryption. A longstanding open question has been the following: can we design a fast, scalable, linear storage and low-leakage SSE scheme that efficiently supports arbitrary Boolean queries over encrypted databases? In this paper, we present the design, analysis and prototype implementation of the first SSE scheme that efficiently supports conjunctive, disjunctive and more general Boolean queries (in both the conjunctive and disjunctive normal forms) while scaling smoothly to extremely large encrypted databases, and while incurring linear storage overheads and supporting extremely fast query processing in practice. We quantify the leakage of our proposal via a rigorous cryptographic analysis and argue that it achieves security against a well-known class of leakage-abuse and volume analysis attacks. Finally, we demonstrate the storage-efficiency and scalability of our proposed scheme by presenting experimental results of a prototype implementation of our scheme over large real-world databases.

STUDY OF THE CRYPTOGRAPHIC STRENGTH OF THE S-BOX OBTAINED ON THE BASIS OF EXPONENTIATION MODULO

This article presents one of the main transformations of symmetric block ciphers used to protect confidential information, a new method for obtaining a non-linear S block, and an analysis of the results obtained. The S-box obtained by this method can be used as a non-linear transformation in block cipher algorithms to protect confidential data transmitted over an open channel. In most well-known works in the field of analysis and synthesis of modern block symmetric ciphers, S-box is used as a mathematical apparatus for cryptographic Boolean functions. In this case, each S-box is represented by a set of composite Boolean functions whose properties characterize the efficiency of the nonlinear substitution node. Substitution nodes for modern symmetric primitives, including key unfolding functions, are usually implemented as replacement tables. Considering that in most modern block symmetric ciphers for introducing round keys, the encryption algorithm uses a linear operation (bitwise addition modulo 2), S-blocks are the only elements responsible for the cryptographic stability of block encryption algorithms. The required number of rounds of block symmetric ciphers is selected taking into account the results of the cryptographic analysis performed, provided that the properties of S-boxes are specified. As the main criteria and performance indicators, the balance and nonlinearity of composite Boolean functions are used; strict avalanche criterion (SAC), propagation criterion; algebraic degree; the value of the autocorrelation function. In this article, a study was made of the nonlinearity and strict avalanche criterion (SAC) of the S-box used in the block symmetric encryption algorithm. The results of the study were compared with the S-boxes of modern cryptographic algorithms and showed good results.

LIKA: Lightweight Identity Based Key Agreement Protocol for Secure Data Transmission in Advanced Metering Infrastructure of Smart Grid

Integration of information communication technology via the Internet of Things devices and sensors can enable an efficient power service for utility providers to consumers in advanced metering infrastructure. Authentication and cryptographic mechanisms protect identity, data security and privacy from unauthorised interception for smart meters to servers. In the last couple of years, many key agreement protocols have been prescribed and deployed to fix those issues. Unfortunately, the deployed protocols did not work inside the same protocols, specifically parameter detection and recognition for session key generation, as they entail high computation time and communication bits overheads. Furthermore, the absence of forward secrecy and user anonymity affects the authentication. Therefore, we have proposed a lightweight identity-based key agreement (LIKA) utilising the Diffie–Hellman cryptography with a trusted authority. It seeks to cover both the security and performance criteria with equal weight. The protocol is evaluated by the Canetti and Krawczyk adversarial model, Avispa and cryptographic analysis released the session keys that were not considered as an adversary during mutual authentication. Moreover, as compared to related work, the proposed protocol took the least amount of time (5.319 ms and 1056 bits) for the entire process of session key generation. Furthermore, comparative analysis has shown that the LIKA adequately encompasses computation, communication, and security assessments. Consequently, it is more convenient for practical implementation for a smart grid.

A parallel image encryption algorithm using intra bitplane scrambling

More and more privacy-sensitive images have been produced daily. Chaotic encryption guarantees that only the targeted receiver can obtain the raw image. Many works perform encryption on bit-level for better permutation but incur an unbearable time consumption caused by generating additional 3D coordinates. High-dimensional chaotic system, suitable for encrypting images, needs to iterate repeatedly for several rounds, resulting in low encrypting efficiency. This paper proposes a parallel image encryption algorithm using intra bitplane scrambling. Four threads are utilized to encrypt the images in bit-level during the permutation, where each thread scrambles two bitplanes. In diffusion, we build multiple threads to generate keystream segments to reduce encryption time. We make cryptographic analyses and compare the encryption speed with the advanced works, demonstrating that our scheme is secure and efficient.

Efficient binary diffusion matrix structures for dynamic key-dependent cryptographic algorithms

In this paper, we propose a new mechanism for the generation of dynamic binary diffusion matrices, with a flexible dimension (n×n), to be used in the design of new symmetric cryptographic algorithms. The proposed framework defines four primary invertible and non-invertible binary diffusion matrix forms. The advantages of these forms stem from the dynamic key approach, where each primary matrix requires the construction of two pseudo-random sub-matrices (Mu and Mv) with a size that depends on two variables (m and l). A cryptographic analysis was carried out to detect the optimal size of m and l for the construction of the matrices to achieve the best possible cryptographic performance and thus, to provide better immunity against different types of attacks. The results showed that the optimal size for m is ∈{n2−1,n2,n2+1}, and for l=n−m. Accordingly, the proposed scheme was designed with an optimal size of m and l, which resulted an acceptable linear branch number and low fixed numbers. In comparison to the existing static diffusion techniques, the proposed solution offers a higher security level since the diffusion matrices are constantly changing and they depend of the dynamic key, which is unknown to attackers.

ПРИМЕНЕНИЕ АСИНХРОННЫХ СХЕМ ДЛЯ ПОВЫШЕНИЯ ЗАЩИТЫ ОТ АТАК ПО СТОРОННИМ КАНАЛАМ

The aim of this study is to analyze the use of asynchronous circuits to improve the security of information systems against side-channels attacks, which are means of obtaining unauthorized access to confidential data and performing unauthorized actions in the system. Side-channels attacks are fundamentally different as compared with a cryptographic analysis and an exploitation of software errors in their focus on the hardware of the system under attack. Integrated circuits unintentionally create electromagnetic signals during their operation and have a number of performance characteristics that can be investigated by an attacker and therefore become the sources of information leakage, i.e., side-channels. The security of modern information systems cannot be fully ensured without increasing resistance to such attacks. One of the methods to counter side-channel attacks is the use of asynchronous circuits, which main distinguishing feature is the refusal from the use of a global clock signal to synchronize individual elements of an integrated circuit in favour of local synchronization provided by the "handshake" mechanism. Integrated circuits designed using asynchronous circuitry have a number of unique benefits that make it possible to effectively resist side-channel attacks, such as timing attacks and attacks with using power consumption analysis. This paper presents a classification of side-channels attacks, describes asynchronous circuits and their properties that increase their resistance to certain types of side-channels attacks, and provides examples that clearly show the increase in the protection of information systems with the asynchronous circuits.

Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography

It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called sampling-based entropic uncertainty relations, deriving newer, more powerful, relations and applying them to source-independent quantum random number generators and high-dimensional quantum key distribution protocols. Along the way, we prove several interesting results in the asymptotic case for our entropic uncertainty relations. These sampling-based approaches to entropic uncertainty, and their application to quantum cryptography, hold great potential for deriving proofs of security for quantum cryptographic systems, and the approaches we use here may be applicable to an even wider range of scenarios.

Binary Multifold Encryption Technique for Complex Cloud Systems

Data security is a major cloud computing issue due to different user transactions in the system. The evolution of cryptography and cryptographic analysis are regarded domains of current research. deoxyribo nucleic acid (DNA) cryptography makes use of DNA as a sensing platform, which is then manipulated using a variety of molecular methods. Many security mechanisms including knowledge-based authentication, two-factor authentication, adaptive authentication, multifactor authentication and single password authentication have been deployed. These cryptographic techniques have been developed to ensure confidentiality, but most of them are based on complex mathematical calculations and equations. In the proposed approach, a novel and unique Hybrid helix scuttle-deoxy ribo nucleic acids (HHS-DNA) encryption algorithm has been proposed which is inspired by DNA cryptography and Helix scuttle. The proposed HHS-DNA is a type of multifold binary version of DNA (MF-BDNA). The major role of this paper is to present a multifold HHS-DNA algorithm to encrypt the cloud data assuring more security with less complexity. The experimentation is carried out and it reduces the encryption time, cipher text size, and improves throughput. When compared with previous techniques, there is a 45% improvement in throughput, 37% fast in encryption time, 54.67% cipher text size. The relevant experimental results and foregoing analysis show that this method is of good robustness, stability, and security.

Об эвристическом алгоритме построения подстановок с заданными криптографическими характеристиками с использованием обобщённой конструкции

In this paper, we study a generalized construction of (2m, 2m)-functions using monomial and arbitrary m-bit permutations as constituent elements. We investigate the possibility of constructing bijective vectorial Boolean functions (permutations) with specified cryptographic properties that ensure the resistance of encryption algorithms to linear and differential methods of cryptographic analysis. We propose a heuristic algorithm for obtaining permutations with the given nonlinearity and differential uniformity based on the generalized construction. For this purpose, we look for auxiliary permutations of a lower dimension using the ideas of the genetic algorithm, spectral-linear, and spectral-difference methods. In the case of m = 4, the proposed algorithm consists of iterative multiplication of the initial randomly generated 4-bit permutations by transposition, selecting the best ones in nonlinearity, the differential uniformity, and the corresponding values in the linear and differential spectra among the obtained 8-bit permutations. We show how to optimize the calculation of cryptographic properties at each iteration of the algorithm. Experimental studies of the most interesting, from a practical point of view, 8-bit permutations have shown that it is possible to construct 6-uniform permutations with nonlinearity 108.

Audio Encryption Algorithm Based on Chen Memristor Chaotic System

The data space for audio signals is large, the correlation is strong, and the traditional encryption algorithm cannot meet the needs of efficiency and safety. To solve this problem, an audio encryption algorithm based on Chen memristor chaotic system is proposed. The core idea of the algorithm is to encrypt the audio signal into the color image information. Most of the traditional audio encryption algorithms are transmitted in the form of noise, which makes it easy to attract the attention of attackers. In this paper, a special encryption method is used to obtain higher security. Firstly, the Fast Walsh–Hadamar Transform (FWHT) is used to compress and denoise the signal. Different from the Fast Fourier Transform (FFT) and the Discrete Cosine Transform (DCT), FWHT has good energy compression characteristics. In addition, compared with that of the triangular basis function of the Fast Fourier Transform, the rectangular basis function of the FWHT can be more effectively implemented in the digital circuit to transform the reconstructed dual-channel audio signal into the R and B layers of the digital image matrix, respectively. Furthermore, a new Chen memristor chaotic system solves the periodic window problems, such as the limited chaos range and nonuniform distribution. It can generate a mask block with high complexity and fill it into the G layer of the color image matrix to obtain a color audio image. In the next place, combining plaintext information with color audio images, interactive channel shuffling can not only weaken the correlation between adjacent samples, but also effectively resist selective plaintext attacks. Finally, the cryptographic block is used for overlapping diffusion encryption to fill the silence period of the speech signal, so as to obtain the ciphertext audio. Experimental results and comparative analysis show that the algorithm is suitable for different types of audio signals, and can resist many common cryptographic analysis attacks. Compared with that of similar audio encryption algorithms, the security index of the algorithm is better, and the efficiency of the algorithm is greatly improved.

USAGE OF HASH METHODS IN THE CRYPTOGRAPHIC DATA ANALYSIS

The tasks of information security system include identifying potential or actual sources of threat to system’s work and minimizing consequences of unauthorized influence on it. While solving them, arises the need of restoration of the initial state of the information system, especially the data integrity. While performing information message analysis the other task may be finding differences between two data fragments or their instances. This paper offers methods of the complex solution of the information security tasks and the analysis of data streams using the means of cryptography and presents the experience of developing the reliable implementation of these methods. The developed methods allow detecting falsifications in data part of the sent message and restoring the initial message. During the cryptographic analysis, the area of change in a data block is localized using cross hashing which is performed by computing the hash of information message block by block. The result is the program implementation of the offered method of information stream analysis that is based on comparing three frames of input data. The effectiveness of detecting falsifications in a data stream depending on algorithm’s sensitivity was researched with the developed instrument. The dependence of the share of falsifications detected by the system in the information block on the established maximum allowable relative deviation from the median and the properties of the input stream, in particular, the division of the input data into frames, was experimentally revealed. It is expected that the advantages of the method will be higher in the preliminary stage of data flow analysis related to its segmentation before addressing the selected fragments to more accurate and specialized algorithms.

On the use of Egyptian fractions for stream ciphers

Within the scope of the mutual interference between modern number theory and chaos-based cryptography, and as it is well-known and already explored for the decimal or the continued fraction expansion of irrational numbers, interesting random-like behaviors seem to be hidden in Egyptian fraction expansions, thus suggesting new chaos-based encryption systems. In fact, at a practical level, and as will be shown through the present study, concatenation of involved denominators and binary expansion generally lead to pseudo-random streams which satisfactorily pass the NIST statistical test suite for randomness. Then, to a certain extent, and for cryptographic purposes, this can be considered as a new tool to complete the conventional class of already-in-use pseudo-random number generators. Some mathematical issues, however, have to be clarified, as for example the chaoticity of the process obtained after converting these denominators to fractional parts of a wandering sequence of real numbers in the unit interval. To the best of our knowledge, and from a cryptographic point of view, previous works on the subject are limited to statistical tests (and subsequent cryptographic analysis) of the resulting one-time pads or stream ciphers, but no rigorous study has been conducted to justify these methods within chaos theory. Considering Egyptian expansions as a working example and using the term “chaotic” in the sense of Devaney, this is what our proposal is aimed at in the present work.

Quantum Differential Collision Distinguishing Attacks on Feistel Schemes

Feistel schemes are important components of symmetric ciphers, which have been extensively studied in the classical setting. We examine the extension methods of differential distinguishers of Feistel key-function and Feistel function-key schemes. The schemes are subjected to quantum differential collision distinguishing attacks based on the methods. The results show that the complexity is lower than that of differential attacks using only Grover algorithm, and the complexity of differential collision attack based on the Brassard-Høyer-Tapp and Grover algorithms is lower than that of quantization when using only the Grover algorithm. The results also show that different algorithms and methods can be combined to produce a more effective cryptanalysis approach. This provides a research direction for post-quantum cryptographic analysis and design.