Block Encryption Algorithm Research Articles

An image encryption algorithm for colour images based on a cellular neural network and the Chua's chaotic system

In the internet era, image encryption technology plays a crucial role in ensuring the security of image information. Aiming at the problem that low-dimensional chaotic encryption has a relatively small key space and is vulnerable to chosen-plain attacks, this paper proposed a novel colour image block encryption algorithm based on the cellular neural network and the Chua's chaotic system. Firstly, the plain is separated into three primary colours. And Fourier transform is applied to achieve optical transformation, generating six chaotic sequences iteratively. Secondly, the chaotic sequences were combined in pairs. And then combined with the plain to form three sequences, which were used in the diffusion process. Finally, the improved Chua's chaotic system is used to scramble the image. Both diffusion and scrambling are performed synchronously during encryption. Through the above operation, we get the final colour encrypted picture. The experimental results show that the algorithm has excellent encryption effect and can resist common attacks.

A Modified AES-512 Bits Algorithm for Data Encryption

Privacy is given top priority as far as communication involving transfer of confidential document or data is concerned. There is therefore a need to keep confidential data secretive from being invaded by unauthorised access, and this is done through cryptography algorithms, where the Advanced Encryption Standard algorithm has been the widely accepted symmetric block encryption algorithm for such purposes. This paper therefore focuses on developing a new AES-512 bits symmetric encryption algorithm through modification of the conventional AES-128 algorithm to be used purposefully in the classroom for document transfer.The development comes with increasing the plaintext bits of the conventional AES-128 algorithm to 512 bits plaintext which undergoes five operational transformations: STATE, SKGF, SRL, SCL and AARC through key size in the Galois field, GF(29). A numerical example is then given to explain the use of the algorithm, and finally, we provide a comparative study of this algorithm and other existing symmetric encryption models, such as the AES-128 and DES algorithms.

PPIDSG: A Privacy-Preserving Image Distribution Sharing Scheme with GAN in Federated Learning

Federated learning (FL) has attracted growing attention since it allows for privacy-preserving collaborative training on decentralized clients without explicitly uploading sensitive data to the central server. However, recent works have revealed that it still has the risk of exposing private data to adversaries. In this paper, we conduct reconstruction attacks and enhance inference attacks on various datasets to better understand that sharing trained classification model parameters to a central server is the main problem of privacy leakage in FL. To tackle this problem, a privacy-preserving image distribution sharing scheme with GAN (PPIDSG) is proposed, which consists of a block scrambling-based encryption algorithm, an image distribution sharing method, and local classification training. Specifically, our method can capture the distribution of a target image domain which is transformed by the block encryption algorithm, and upload generator parameters to avoid classifier sharing with negligible influence on model performance. Furthermore, we apply a feature extractor to motivate model utility and train it separately from the classifier. The extensive experimental results and security analyses demonstrate the superiority of our proposed scheme compared to other state-of-the-art defense methods. The code is available at https://github.com/ytingma/PPIDSG.

Secure and Efficient NVM Usage for Embedded Systems Using AES-128 and Huffman Compression

Embedded systems are customized systems designed to meet functionality and specific usage purposes. These systems often grapple with challenges such as power interruptions, limited memory space, and the expectation of a long operational lifespan. It is in this context that Non-Volatile Memory (NVM) plays a vital role. NVM is a type of memory that ensures data persistence even in situations of temporary power loss or signal interruptions. Efficiently utilizing NVM is a critical necessity for the effectiveness and reliability of these systems. Efficient utilization of NVM necessitates the effective management of write and read cycles. Previous studies have demonstrated the efficient utilization of NVM sectors by ensuring that no garbage bytes remain unallocated. Previous studies have demonstrated the efficient utilization of NVM by compressing the data to be written into NVM using the Huffman compression algorithm, and filling sectors without any residual garbage bytes. This paper aspires to advance beyond prior research by integrating the Advanced Encryption Standard (AES-128) block encryption algorithm, aiming to optimize the utilization of NVM to a greater extent. The AES-128 algorithm provides data security with encryption and decryption operations. By applying AES-128 encryption to the data before writing it to the NVM, this work adds a data security layer to the developed software module. Data is divided into blocks using this algorithm. Each block is encrypted independently and then reassembled. The encryption process includes key management, substitution-permutation network layers, and multiple rounds, all of which make substantial contributions to high-level data security. The resulting encrypted data is compressed using the Huffman compression algorithm. This process enhances both the security and efficiency of data storage. The data is written to NVM with maximum efficiency, ensuring that no residual garbage bytes remain, upon the completion of the encryption and compression processes. This study surpasses previous research by enhancing storage security and efficiency through these processes. Moreover, the developed secure and efficient NVM usage, as it fills the NVM with data without leaving any garbage bytes, results in slower processing speed compared to standard NVM usage. Therefore, in future research, interventions with code optimization techniques can be applied to the developed algorithms to enhance write and read speeds.

Application of Decimated Mathematical Equations and Polynomial Root-Finding Method in Protection of Text Messages

Cryptography is the process of transforming data so that only the recipient of the message can read it. It uses an algorithm and a key to convert an input into an encrypted output. In this study, we introduce a novel method for protecting readable messages through the utilization of a polynomial root-finding technique in conjunction with the decimated output of Zaslavsky equations. The innovative approach we have developed is a block encryption algorithm that offers both protection for sensitive information as well as adaptability to various block sizes, including dynamically changing block sizes. Precise security analysis is provided for the proposed algorithm using key space analysis and strong statistical tests. The presented results show that the novel block encryption protection provides a high level of security.

An efficient construction of S-box based on the fractional-order Rabinovich–Fabrikant chaotic system

For many block encryption algorithms, confusion properties are only related to the substitution box (S-box). The S-box is a crucial component of cryptography. The security of the whole system is affected by the S-box. Consequently, alternative S-box designs and construction methods have been explored in various studies. In this paper, based on the chaotic Rabinovich–Fabrikant fractional order (FO) system, a new method for constructing a strong initial S-box is proposed. To comply with the objective, the numerical results of the FO chaotic Rabinovich–Fabrikant system are provided by using the four-step Runge Kutta method/Adams–Bashforth–Moulton method for a=0.87, b=1.1, and α=0.99. A novel key-based permutation technique is also presented to enhance the functionality of the initial S-box and construct the final S-box. A comparison is made between the performance of the substitution boxes (S-boxes) proposed and that of some other existing chaotic S-box designs. It is perceived that the S-boxes obtained by our proposed methods are stronger. The results of the analysis of the initial and final S-box yield favorable statistics, which make sure of its importance in the use of secure communications. Furthermore, the proposed final S-box’s effectiveness in image encryption applications is evaluated through the majority logic criterion (MLC), resulting in exceptional outcomes.

Fast image encryption algorithm with random structures

Block encryption algorithms are among the most preferred applications in cryptographic systems. Block ciphers should have accomplished some requirements for a secure communication system. They should be evaluated in terms of cryptanalysis methods for widespread usage. The aim of this paper is to introduce a new secure and fast block encryption algorithm for images. For this purpose, a new block cipher, which offers an innovative encryption structure for key generation systems and can use S-boxes with different methods, is proposed. A Dynamic S-Box is used in the algorithm for both substitution and key generation purposes. Linear and differential cryptanalysis methods were performed successfully. UACI and NPCR tests show that the proposed symmetric block cipher algorithm is compatible with image encryption systems. The 512-bit key length provides the highest security for block encryption. Additionally, information entropy test, correlation coefficients, mean-squared error, and peak signal-to-noise ratio analyses were concluded successfully. The novelty of the paper is building a cryptanalysis attack-resistant block cipher algorithm that presents a lightweight cryptographic solution for image encryption systems.

A lightweight block encryption algorithm for narrowband internet of things

A lightweight block encryption algorithm for narrowband internet of things

Методика подвійної автентифікації для RFID систем управління доступом з підвищеним рівнем захисту

Currently, there are no uniform international standards for devices and systems that use radio frequency identification technology. Using tag alone as an identifier imposes certain restrictions on the level of protection of access control systems, since the unique tag identifier can be easily copied, so two-step authentication is required. The second level of protection can be a digital password entered via the keyboard. The work presents dual authentication technique for access control to the premises. Increasing the level of protection of radio frequency identification systems is achieved by the additional use of a digital password encrypted using a symmetric block encryption algorithm and recorded on the tag. This removes any restrictions on the number of registered users in the system, because passwords and IDs are stored on tags. The laboratory model of the device is based on the NodeMCU-32S Opensource platform with an RFID module that allows connection to most fog and cloud services of the Internet of things. The development is based on the ESP32 controller, which supports the necessary set of commands and hardware for implementing the methodology, in particular, wireless standards and communication protocols, hardware-accelerated encryption. The Cayenne service from MyDevices was chosen as the cloud platform, which made it possible to configure the device using the publish-subscribe messaging protocol and develop a graphical user interface. A log on the Cayenne platform is used to keep track of users, a character display is used to display the current status and settings of the device, and a serial interface is used to debug work algorithms. The software is implemented using the Arduino C programming language.

Components and kay features of the analisis symmetric cryptocircuit

This article discusses the key aspects and technologies of applying many cryptanalysis methods for assessing the stability of symmetric block encryption algorithms. The following aspects of analysis methods such as linear, differential, slide attack, algebraic analyzes are also considered. Approaches to the analysis of the AES standard are compared. Also, when considering the approaches to the analysis of modern symmetric cryptosystems, special attention is paid to special questions regarding the possibility of using distributed multiprocessor calculations in order to reduce the analysis time.

LILP: A Lightweight Enciphering Algorithm to Encrypt Arbitrary-Length Messages

The advancement of the Internet of Things (IoT) has promoted the development of embedded devices. It is important to ensure data transmission security on embedded devices with limited computing power and storage space. However, the traditional block encryption algorithm cannot run efficiently on embedded devices because of the large amount of computation. In this paper, a lightweight length-preserving-encryption algorithm (LILP) is proposed to convert an n-bit block cipher into a special block cipher that supports an arbitrary length of no less than 2n bits as input. LILP adopts the involution design method based on a Lai–Massey structure and lightweight components to adapt to the limited computing power of embedded devices. In particular, a lightweight compression function (LCF) is designed to process the data during iteration, which improves security without reducing the efficiency of the algorithm. The experimental results show that LILP is more efficient than traditional similar algorithms in encrypting data for resource-constrained devices while ensuring data security in the IoT.

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.

An algorithm for using a cross-platform mobile application to protect information in cloud storage

Objective. A high-quality "cloud storage" of data should ensure the confidentiality, integrity and availability of information in the "storage". The use of "cloud storage" for storing information in backups is associated with their possible loss. Ensuring the confidentiality of information in the "cloud storage" implies that by "uploading" data to the "cloud storage", the user must be sure that an attacker will not be able to obtain information from the storage. The aim of the study is to develop an algorithm for using a cross-platform mobile application to protect information in the "cloud storage" of IS.Method. The study is based on the use of a cross-platform approach to creating applications.Result. The analysis of existing approaches and frameworks for the development of crossplatform mobile applications was carried out. It is proposed to create an application based on the Xamarin framework. To ensure the confidentiality of information, it is proposed to encrypt them before uploading data and backup copies of files. Encryption involves hiding the original type of the file from unauthorized use using crypto-algorithms, when the owner of the encryption key is the authorized user. To implement the function of encrypting data and backup copies of files uploaded to the "cloud storage", it is proposed to use the Rijndael symmetric block encryption algorithm, adopted as an encryption standard according to the results of the Advanced Encryption Standard (USA) competition.Conclusion. A cross-platform mobile application can be compiled and run efficiently under iOS and Android operating systems, encrypt files and upload them to the "cloud storage" with the possibility of subsequent decryption.

A Novel Lightweight Block Encryption Algorithm Based on Combined Chaotic System

Due to the high complexity of traditional block cipher, which is not suitable for resource constrained devices such as wireless sensors. Therefore, this paper proposes a novel lightweight block encryption algorithm based on combined chaotic system. Firstly, a novel combined chaotic system with good pseudo-random characteristics is proposed to construct S-boxes with high security and p-boxes with excellent diffusion performance. Secondly, a novel lightweight encryption and decryption structure are designed based on Feistel encryption structure, which reduces the computational complexity and memory consumption of the encryption and decryption process, and the designed round function can use different lengths of block and key, which means the structure has excellent scalability. The software and hardware implementation test and security test results show that the proposed lightweight block encryption algorithm based on combined chaotic system (LBCCS) provides an efficient and secure encryption way for the resource constrained devices.

Cryptanalyzing a Feistel Chaotic Block Cryptosystem Based on Correlation Power Analysis

Chaos-based block encryption algorithms have been proposed for years and their securities have been tested using conventional statistical methodologies, i.e. frequency analysis, avalanche analysis, entropy analysis, etc. However, when those algorithms are carried out on hardware devices, some crucial physical information may leak during the encryption or decryption processes. Feistel chaotic block cryptosystem has been proposed recently and is used for the block ciphers in different applications such as Internet-of-Things. In this work, the security of a Feistel chaotic block cryptographic algorithm is investigated by using Correlation Power Analysis (CPA) when the cryptographic system is in the process of performing encryption. Especially, the cryptosystem is implemented on an Atmel XMEGA128D4 micro controller. The attack points of Feistel chaos-based block encryption algorithm and power mapping model are analyzed in detail, and the procedure of utilizing CPA is given to cryptanalyze its hardware security. In theory, Multiple Samples Correlation Power Analysis (MSCPA) has a higher correct key differentiating level than CPA. However, in practice, if the correct key cannot be recovered by using CPA, the interesting sample points of power trace cannot be found for MSCPA. Experimental results show that the CPA can successfully obtain the secret key of Feistel cryptosystems and interesting sample points of power trace can be found, which laid a foundation of MSCPA to combine multiple samples of power trace. Further, the CPA can hit 100% success rate within [Formula: see text]50 power traces. Overall, this work can help efficiently evaluate the hardware security of Feistel chaotic block cryptosystem.

128-Bit LEA Block Encryption Architecture to Improve the Security of IoT Systems with Limited Resources and Area

The LEA block encryption algorithm is an architecture suitable for IoT systems with limited resources and space. It was developed by the National Security Technology Research Institute in 2013 and established as an international standard for cryptography by the International Electrotechnical Commission in 2019, drawing much attention from developers. In this paper, the 128-bit LEA block encryption algorithm was light weighted and implemented in a hardware environment. All modules share and reuse registers and are designed and implemented in a bottom area through the resource sharing function. As a result of synthesis using Xilinx ISE 14.7 Virtex-5 as a design environment, the maximum frequency achieved 190.88 MHz and has a processing speed of up to 128 Mbps. Compared to the previously designed architecture, we present a bottom-level hardware design with a 128-bit LEA algorithm implemented with a 49.8% reduction in Flip-Flop, 18.8% reduction in LUTs, and 67.6% reduction in Slices.

Optimization and Design of Key Expansion of SM4 Algorithm Based on ZYNQ

As the application of "China Intelligent Manufacturing" in the field of production becomes more and more extensive, it becomes crucial to ensure the security of information interaction between production equipment. China's domestic encryption algorithm - SM4 block encryption algorithm came into being. The algorithm consists of a key expansion function and an encryption and decryption function. The key expansion function collects 128-bit keys at a time, and generates thirty-two 32-bit encryption keys after XOR operation, nonlinear permutation operation (S-box) and linear shift operation.The XOR operation parameter CK of the original key expansion function is obtained by the modulo method, which is similar to the system parameter FK and is a fixed value. In order to reduce the risk of deciphering caused by fixed parameters, the lightweight two-dimensional chaos algorithm Hemon is introduced for optimization design. The system parameters used in the SM4 algorithm are randomly generated with the change of the key, which improves the security of the algorithm. And use the hardware encryption platform ZYNQ-7000 series model xc7z100ffv900-1 FPGA side design and implementation, relying on the hard to decipher of hardware encryption to complete the optimization of SM4 algorithm key exchange.

Block Cipher's Substitution Box Generation Based on Natural Randomness in Underwater Acoustics and Knight's Tour Chain.

The protection of confidential information is a global issue, and block encryption algorithms are the most reliable option for securing data. The famous information theorist, Claude Shannon, has given two desirable characteristics that should exist in a strong cipher which are substitution and permutation in their fundamental research on “Communication Theory of Secrecy Systems.” block ciphers strictly follow the substitution and permutation principle in an iterative manner to generate a ciphertext. The actual strength of the block ciphers against several attacks is entirely based on its substitution characteristic, which is gained by using the substitution box (S-box). In the current literature, algebraic structure-based and chaos-based techniques are highly used for the construction of S-boxes because both these techniques have favourable features for S-box construction but also various attacks of these techniques have been identified including SAT solver, linear and differential attacks, Gröbner-based attacks, XSL attacks, interpolation attacks, XL-based attacks, finite precision effect, chaotic systems degradation, predictability, weak randomness, chaotic discontinuity, and limited control parameters. The main objective of this research is to design a novel technique for the dynamic generation of S-boxes that are safe against the cryptanalysis techniques of algebraic structure-based and chaos-based approaches. True randomness has been universally recognized as the ideal method for cipher primitives design because true random numbers are unpredictable, irreversible, and unreproducible. The biggest challenge we faced during this research was how can we generate the true random numbers and how can true random numbers utilized for strengthening the S-box construction technique. The basic concept of the proposed technique is the extraction of true random bits from underwater acoustic waves and to design a novel technique for the dynamic generation of S-boxes using the chain of knight's tour. Rather than algebraic structure- and chaos-based techniques, our proposed technique depends on inevitable high-quality randomness which exists in underwater acoustics waves. The proposed method satisfies all standard evaluation tests of S-boxes construction and true random numbers generation. Two million bits have been analyzed using the NIST randomness test suite, and the results show that underwater sound waves are an impeccable entropy source for true randomness. Additionally, our dynamically generated S-boxes have better or equal strength, over the latest published S-boxes (2020 to 2021). According to our knowledge first time, this type of research has been conducted, in which natural randomness of underwater acoustic waves has been used for the construction of block cipher's substitution box.

The Network EPES8–2

The article presents the EPES8–2 network with two round functions using the same algorithm for encryption and decryption. INTRODUCTION: Currently, block encryption algorithms based on the Feystel network are widely used. Block encryption algorithms based on the Feystel network include encryption algorithms such as DES, GOST 28147-89, as well as block encryption algorithms such as CAST 256, DFC, E2, LOKI97, which participated in the competition announced by NIST. The advantage of this network is that a single algorithm is used for encryption and decryption, only the encryption round keys are used in reverse order for decryption.

An Enhanced Block Pre-processing of PRESENT Algorithm for Fingerprint Template Encryption in the Internet of Things Environment

Many previous studies had proven that The PRESENT algorithm is ultra-lightweight encryption. Therefore, it is suitable for use in an IoT environment. However, the main problem with block encryption algorithms like PRESENT is that it causes attackers to break the encryption key. In the context of a fingerprint template, it contains a header and many zero blocks that lead to a pattern and make it easier for attackers to obtain an encryption key. Thus, this research proposed header and zero blocks bypass method during the block pre-processing to overcome this problem. First, the original PRESENT algorithm was enhanced by incorporating the block pre-processing phase. Then, the algorithm’s performance was tested using three measures: time, memory usage, and CPU usage for encrypting and decrypting fingerprint templates. This study demonstrated that the proposed method encrypted and decrypted the fingerprint templates faster with the same CPU usage of the original algorithm but consumed higher memory. Thus, it has the potential to be used in IoT environments for security.