Efficient Block Cipher Research Articles

An Image Encryption Method Based on a High-performance and Efficient Block Cipher

An Image Encryption Method Based on a High-performance and Efficient Block Cipher

Proposed Method for Efficient Block Cipher Cryptography

After the use of the Internet and the transmission of files between users expanded, information security became one of the important priorities for securing information by different means and methods. The information encryption comes at the forefront of the techniques used in information security. Encryption has been known since ancient ages. So, traditional methods appeared that quickly and greatly developed. They are still used in many scientific studies and developmental research with the aim of developing new methods for encryption of substitutions and increasing its ability to confront various attacks. The traditional methods were subjected to several attacks that they prompted researchers to develop them and overcome their weaknesses in front of those attacks. Some combinations of these methods are used to design new encryption methods based on overlapping ideas of traditional encryption. This paper sought to use a set of traditional encryption methods in designing a new system. In which, these methods are mixed with modern ideas that help increase the strength of encryption and its ability to face potential attacks. Caesar, Vigenère, Rail Fence, and transpose ciphers, with the idea of cipher cycles and segments and division into two parts in block ciphers. The proposed system relied on the chaotic function Tent map for its random properties in generating a string of keys consisting of 112 random characters in length using Python 3.11 programming language. The text was cut into Blocks of 108 characters. Each Block was divided into two parts. A part of the key was added to each section. A rial fence method was applied. Then Vigenère method with the key is applied. The proposed system processed the original text within the framework of the encryption cycles with the use of substitution in the order of the columns, shifting to the right, and the replacement of the sequence of the elements of each side according to the order of the elements of the other side. After the end of the encrypting cycles, the cipher block is added to the final ciphertext. The operations were repeated for the next block until the last block is finished. For the purpose of decrypting, the previous operations are repeated in reverse order to obtain the original text, by decrypting blocks of the cipher text. The proposed system achieved extreme accuracy in extracting the original text. The system was evaluated by measuring the time and throughput of the encryption and decryption. The encryption and decryption times were short for short texts, which increased with the increase in the length of the text, with a relatively stable encryption and decryption throughput. The system achieved acceptable memory consumption in short texts but increased by the length of the text size. The achieved Avalanche test was less than (50%).

Efficient hardware implementation of SIMECK lightweight block cipher

The internet of things (IoT) has recently expanded, resulting in a new world of smart gadgets with substantial security consequences. For their vital security role, lightweight block ciphers have gained a significant amount of development in low resource devices (LRDs). SIMECK is a new lightweight block cipher family that incorporates the finest aspect of both SIMON and SPECK. SIMECK is a more efficient block cipher than SIMON and SPECK cipher. These lightweight ciphers are especially referred to as an alternative to the AES for RCD. In this study, area optimised architecture is implemented for SIMECK lightweight block cipher with sizes: 64/128. For implementation on different platforms such as Sparton-6, Sparton-3, Virtex-7, Virtex-6, Virtex-5 and Virtex-4 FPGA are used to examine several properties such as block size, key scheduling, and throughput, among others. The proposed area optimised architecture have attained a maximum operating frequency of 496.429 MHz with 61 slices and a high throughput of 706.032 Mbps on the Virtex-7 platform.

Block Cipher in the Ideal Cipher Model: A Dedicated Permutation Modeled as a Black-Box Public Random Permutation

Designing a secure construction has always been a fascinating area for the researchers in the field of symmetric key cryptography. This research aimed to make contributions to the design of secure block cipher in the ideal cipher model whose underlying primitive is a family of n − b i t to n − b i t random permutations indexed by secret key. Our target construction of a secure block ciphers denoted as E [ s ] is built on a simple XOR operation and two block cipher invocations, under the assumptions that the block cipher in use is a pseudorandom permutation. One out of these two block cipher invocations produce a subkey that is derived from the secret key. It has been accepted that at least two block cipher invocations with XOR operations are required to achieve beyond birthday bound security. In this paper, we investigated the E [ s ] instances with the advanced proof technique and efficient block cipher constructions that bypass the birthday-bound up to 2 n provable security was achieved. Our study provided new insights to the block cipher that is beyond birthday bound security.

Efficient block cipher mode for NVM

The usage of non-volatile memory (NVM) storage devices is rapidly increasing in consumer and enterprise systems, providing high performance and low energy consumption compared to hard disk drives. Lately it is observed that NVM storage devices are widely used in cloud computing as well. However, existing disk encryption methods are designed for hard disk devices and an efficient block cipher mode of operation for NVM storage devices has not yet been studied in detail. In this work we have analyzed and evaluated performance of CBC, CTR and XTS-AES block cipher modes for whole disk encryption solutions and found that CTR and XTS-AES modes outperform CBC mode under the same scenarios.

Fault Diagnosis Schemes for Low-Energy Block Cipher Midori Benchmarked on FPGA

Achieving secure high-performance implementations for constrained applications such as implantable and wearable medical devices are a priority in efficient block ciphers. However, security of these algorithms is not guaranteed in the presence of malicious and natural faults. Recently, a new lightweight block cipher, Midori, has been proposed that optimizes the energy consumption besides having low latency and hardware complexity. In this paper, fault diagnosis schemes for variants of Midori are proposed. To the best of the authors’ knowledge, there has been no fault diagnosis scheme presented in the literature for Midori to date. The fault diagnosis schemes are provided for the nonlinear S-box layer and for the round structures with both 64-bit and 128-bit Midori symmetric key ciphers. The proposed schemes are benchmarked on a field-programmable gate array and their error coverage is assessed with fault-injection simulations. These proposed error detection architectures make the implementations of this new low-energy lightweight block cipher more reliable.

Generalized Feistel networks revisited

This work deals with the classification, security and efficiency of generalized Feistel networks (GFNs) with 4 lines. We propose a definition of a GFN, essentially limiting consideration to Feistel-type constructions with domain-preserving F-functions and rotation by one line between rounds. Under this definition, we demonstrate that there are only two non-contracting representatives in the class of 4-line GFNs up to equivalence, namely, the type-I and type-II GFNs that avoid obvious differential effects. We propose to instantiate the GFNs with SPS-functions (two substitution layers separated by a permutation layer) instead of single SP-functions (one substitution-permutation layer only). We prove tight lower bounds on the number of differentially and linearly active functions and S-boxes in such ciphers. We show that the instantiation with SPS-functions using MDS diffusion provides a proportion of differentially and linearly active S-boxes by up to 33 and 50 % higher than that with single SP-functions for type-I and type-II GFNs, respectively, if the same matrix is used in all rounds. Moreover, we present the upper bounds on the differential and the linear hull probability for the type-II GFNs with SPS-functions. This opens up the possibility of designing more efficient block ciphers based on GFN structure.

On the differential and linear efficiency of balanced Feistel networks

Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear cryptanalysis, when instantiated with SL-type round functions (BFN–SL). This work suggests that BFNs attain higher efficiency when the round function is defined as a composition of two substitution layers connected by a linear diffusion layer (SLS-type round function). The resulting structure is called BFN–SLS. Tight upper bounds on the differential and linear trail probabilities are proven for such constructions. When compared to BFN–SL with single-round diffusion, BFN–SLS exhibits an increase by almost 1/3 in the proportion of active S-boxes. When compared to BFN–SL with multiple-round diffusion, BFN–SLS provides the same proportion of active S-boxes, requiring, however, twice less linear operations and a single diffusion matrix for all rounds. It is argued that the cost of linear operations cannot be ignored when dealing with efficiency. Different BFNs are compared under consideration of the relative complexity of linear and nonlinear finite field operations. As a result, since BFN–SLS minimizes the number of necessary linear operations, its efficiency is higher than that of the known BFN–SL constructions.

An instruction-level distributed processor for symmetric-key cryptography

Efficient implementation of block ciphers is critical toward achieving both high security and high-speed processing. Numerous block ciphers have been proposed and implemented, using a wide and varied range of functional operations. Existing architectures such as microcontrollers do not provide this broad range of support. Therefore, we will present a hardware architecture that achieves efficient block cipher implementation while maintaining flexibility through reconfiguration. In an effort to achieve such a hardware architecture, a study of a wide range of block ciphers was undertaken to develop an understanding of the functional requirements of each algorithm. This study led to the development of COBRA, a reconfigurable architecture for the efficient implementation of block ciphers. A detailed discussion of the top-level architecture, interconnection scheme, and underlying elements of the architecture will be provided. System configuration and on-the-fly reconfiguration will be analyzed, and from this analysis, it will be demonstrated that the COBRA architecture satisfies the requirements for achieving efficient implementation of a wide range of block ciphers that meet the 622 Mbps ATM network encryption throughput requirement.

A polynomial-time universal security amplifier in the class of block ciphers

We demonstrate the existence of an efficient block cipher with the property that whenever it is composed with any non-perfect cipher, the resulting product is strictly more secure, against an ideal adversary, than the original cipher. We call this property universal security amplification, and note that it holds trivially for a one-time pad (a stream cipher). However, as far as we are aware, this is the first efficient block cipher with this property. Several practical implications of this result are considered.