Proposed Block Cipher Research Articles

Next-Generation Block Ciphers: Achieving Superior Memory Efficiency and Cryptographic Robustness for IoT Devices

Traditional cryptographic methods often need complex designs that require substantial memory and battery power, rendering them unsuitable for small handheld devices. As the prevalence of these devices continues to rise, there is a pressing need to develop smart, memory-efficient cryptographic protocols that provide both high speed and robust security. Current solutions, primarily dependent on dynamic permutations, fall short in terms of encryption and decryption speeds, the cryptographic strength, and the memory efficiency. Consequently, the evolution of lightweight cryptographic algorithms incorporating randomised substitution properties is imperative to meet the stringent security demands of handheld devices effectively. In this paper, we present an advanced design of lightweight block ciphers that enhances traditional dynamic permutations with innovative randomised substitutions. This design utilises straightforward randomized encryption methods such as XOR, nibble swap, count ones, and left shift. The cryptographic robustness of our proposed block cipher has been rigorously tested through several standardised statistical tests, as recommended by the National Institute of Standards and Technology (NIST). These evaluations confirm that our algorithm maintains strong cryptographic properties with randomised substitutions and outperforms existing models in several key aspects. Moreover, comparative assessments reveal that our algorithm achieves a throughput of 853.31 Kbps while consuming only 1510 bytes of memory and demonstrating over 60% avalanche properties, significantly outperforming other solutions in terms of CPU utilisation and memory consumption. These results underscore the efficacy of our approach in fulfilling the advanced security requirements of modern handheld devices.

Differential Attack With Constants On μ2 Block Cipher

Abstract Differential attack is one of the most important methods in cryptanalysis. When finding a high-probability differential trail, the effect of constant has long been ignored. In this paper, we focus on the effect of constants on the differential attack against $\mu ^2$. $\mu ^2$ is a newly proposed block cipher based on a Type-II generalized Feistel structure. Its 16-bit F function (denoted as F-box) is an ultra-lightweight permutation equipped with different constants. The designer applied the minimum number of active S-boxes to determine $\mu ^2$’ security margin in the design document. However, the F-boxes use different round constants in different rounds; the constants may lead to incompatibility of differential trails of F-boxes. Therefore, to provide a more precise differential attack on $\mu ^2$, we construct an model based on STP (Simple Theorem Prover) constraint solver to search for the valid differential trails with a more precise probability of $\mu ^2$ for different starting rounds. Finally, the related-key differential trail covers one more round than the existing methods. Analyzing the effect of constants on the validity and the probability of the differential trail reminds the designers and the attackers to have a more comprehensive analysis of specific ciphers.

Secured transmission design schemes based on chaotic synchronization and optimal high gain observers

The distinguishing feature of the proposed secured transmission design scheme is the use of chaotic nonlinear systems and optimal high gain observers for the encryption/decryption operation and their application in image cryptography. The primary concern in this work is to develop an innovative algorithm for optimizing the high gain observer performances. Therefore, the proposed strategy uses a nonlinear chaotic system in the plain-text encryption phase and the optimal high gain observer in the decryption phase with no interdependence between these two operations. Practically, the chaotic system is suitable to be used as a block cipher as it has a random nature depending on its initial conditions. In addition, it is possible to present the proposed block cipher method as an enhancement of the existing block cipher involving short keys. For the decryption, a challenging design combining a high gain observer and non-dominated sorting genetic algorithms (NSGA-II) for optimizing the observation gain is developed. Efficiency and substantial performances of the synchronization method, tested with nonlinear unified chaotic system and optimal high gain observer, are demonstrated by several numerical simulation scenarios on a prominent QR (Quick Response) code example.

SECURITY ANALYSIS BETWEEN STATIC AND DYNAMIC S-BOXES IN BLOCK CIPHERS

The development of block ciphers has resulted in a number of cryptographic algorithms such as AES, aria, blowfish256, desl, and 3d-aes. AES is one of the best cryptographic algorithms that can be used to protect electronic data. However, the principal weakness in AES is the linearity in the s-box. The objective of this research is to investigate and evaluate the existing work related to the dynamic s-box. Other than that, the aim of this research is to design a dynamic s-box using affine transformation in order to increase the security of the encryption. The method to design is using java with the NetBeans software. The proposed block cipher will be tested using NIST statistical test suite to test the randomness of the algorithm. Besides, the strength of the s-box will be analyzed using the s-box evaluation tool (set). The cryptographic strength depends strongly on the choice of s-box. Therefore, this new proposed block cipher can be used by countries, organizations, stakeholders, or interested parties as one of the secure algorithms to increase the protection of the information and also will contribute as an alternative to other cryptographic algorithms in computer security research.

A novel block cipher for enhancing data security in healthcare internet of things

The modern technologies and their contributions have made monitoring and communication possible from everything around us with each other with no or little human intervention. Experts named these connected devices as Internet of Things (IoT), or the Internet of Everything which is considered as the next industrial revolution. This open network posts quite good number of security challenges because of the nature of the IoT environment. Thus, this paper proposes a lightweight block cipher called, JAC_Jo, to enhance the security of data transmitted in the healthcare environment with reduced hardware footprints. The master key for data encryption is derived using soft set based key generation algorithm SoftKeyGen() and encrypts 32-bit data using 64 bit key. The proposed block cipher occupies 2109 GEs of area and requires 360.05mW power without compromising the security. The FPGA implementation of the proposed block cipher is presented and the performance of the block cipher is evaluated using Atmel STK-600 device with 128 kb app / boot memory. The security evolution is presented with respect to differential, linear, slide and algebraic attacks.

A New 512 Bit Cipher for Secure Communication

The internet today is being used by millions of users for a large variety of commercial and non commercial purposes. It is controlled by different entities. It is mainly used as an efficient means for communication, entertainment and education. With the rapid growth of internet, there is a need for protecting confidential data. The Internet was however originally designed for research and educational purpose, not for commercial applications.So internet was not designed with security in mind. As the internet grows the existing security framework was not adequate for modern day applications. Cryptography play a vital role in providing security.Lot of research is going on block cipher algorithms. In this paper we present a new 512 bit block cipher named SF Block cipher. The proposed cipher is developed based on design principle known as Substitution permutation network (SP Network). The algorithm is implemented in .NET Framework and MATLAB. Cryptanalysis is carried out in the encrypted file. It was found that the encrypted file with this algorithm is difficult to break.Simulation results shows that the proposed Block cipher has better performance over other algorithms such as AES and Blowfish

A Block Cipher Algorithm for Multimedia Content Protection with Random Substitution using Binary Tree Traversal

Many people consume multimedia content (images, music, movie) on portable devices like DVD player, MP3 player, Portable Multimedia Player and also through Internet. Problem statement: The conventional algorithms such as DES and AES cannot be used directly in multimedia data, since multimedia data are repeatedly have high redundancy, large-volumes and require real-time operations, such as displaying, cutting, copying, bit-rate conversion and so forth. A block cipher is usually used to encrypt multimedia content because of its reasonable security and performance. Approach: In this study, we introduce a naive approach of efficient multimedia content encryption scheme which uses a block of bits rather than bytes or pixels. The proposed block cipher encrypts any type of compressed multimedia content by random substitution using binary tree traversal, row shifting and column shifting. Results: Experimental results show that the new algorithm has better performance than DES algorithm, encrypting multimedia content by dividing the plaintext by blocks. Conclusion: The proposed algorithm is implemented for all types of multimedia files like audio, video, images and text data and this algorithm can be used to multimedia data during transmisson through Internet or through any communication channels.

블록암호화 알고리듬 KASUMI의 하드웨어 설계 및 응용

본 논문에서는 KASUMI 암호화 알고리즘을 하드웨어로 구현하였다. 이는 ASIC이나 코어-기반 설계와 같은 여러 응용분야에 적합하도록 범용적으로 구현하였다. 또한 기밀성 알고리즘과 무결성 알고리즘을 모두 수행할 수 있도록 설계하였으며, 파이프라인 구조를 사용하여 높은 동작 주파수에서도 구동될 수 있도록 하였다. 본 논문에서 설계한 하드웨어를 Altera사의 EPXA10F1020C1을 타겟으로 구현한 결과 최대 동작 주파수 36.35MHz에서 안정적으로 동작함을 확인하였다. 따라서 구현된 하드웨어는 현재 중요한 문제로 대두되고 있는 종단간(end-to-end) 보안에 대한 좋은 해결책으로 유용하게 사용될 수 있을 것으로 생각된다. In this paper, we are implemented the kasumi cipher algorithm by hardware. In this work, kasumi was designed technology-independently for application such as ASIC or core-based design. The hardware is implemented to be able to calculate both confidentiality and integrity algorithm, and a pipelined KASUMI hardware is used for a core operator to achieve high operation frequency. The proposed block cipher was mapped into EPXA10F1020C1 from Altera and used 22% of Logic Element (LE) and 10% of memory element. The result from implementing in hardware (FPGA) could operate stably in 36.35MHz. Accordingly, the implemented hardware are expected to be effectively used as a good solution for the end-to-end security which is considered as one of the important problems.

A new cryptosystem based on chaotic map and operations algebraic

Based on the study of some existing chaotic encryption algorithms, a new block cipher is proposed. The proposed cipher encrypts 128-bit plaintext to 128-bit ciphertext blocks, using a 128-bit key K and the initial value x 0 and the control parameter mu of logistic map. It consists of an initial permutation and eight computationally identical rounds followed by an output transformation. Round r uses a 128-bit roundkey K ( r ) to transform a 128-bit input C ( r - 1 ) , which is fed to the next round. The output after round 8 enters the output transformation to produce the final ciphertext. All roundkeys are derived from K and a 128-bit random binary sequence generated from a chaotic map. Analysis shows that the proposed block cipher does not suffer from the flaws of pure chaotic cryptosystems and possesses high security.

A new block cipher based on chaotic map and group theory

Based on the study of some existing chaotic encryption algorithms, a new block cipher is proposed. In the proposed cipher, two sequences of decimal numbers individually generated by two chaotic piecewise linear maps are used to determine the noise vectors by comparing the element of the two sequences. Then a sequence of decimal numbers is used to define a bijection map. The modular multiplication operation in the group Z 2 8 + 1 ∗ and permutations are alternately applied on plaintext with block length of multiples of 64 bits to produce ciphertext blocks of the same length. Analysis show that the proposed block cipher does not suffer from the flaws of pure chaotic cryptosystems.

On some probabilistic approximations for AES-like s-boxes

Several recently proposed block ciphers such as AES, Camellia, Shark, Square and Hierocrypt use s-boxes that are based on the inversion mapping over GF ( 2 n ) . In order to hide the simple algebraic structure in this mapping, an affine transformation over F 2 is usually used after the output of the s-box. In some ciphers, an additional affine transformation is used before the input of the s-box as well. In this paper, we study the algebraic properties of a simple approximation in the form s ( x ) = ax - 1 + b , a , b ∈ GF ( 2 n ) for such s-boxes. The implication of this result on the cryptanalysis of these ciphers remains an open problem.

A lightweight secure protocol for wireless sensor networks

In this paper, based on a Linear Congruential Generator (LCG), we propose a new block cipher that is suitable for constructing a lightweight secure protocol for resource-constrained wireless sensor networks. From the cryptanalysis point of view, our building block is considered secure if the attacker cannot obtain the pseudo-random numbers generated by the LCG. The Plumstead’s inference algorithm for a LCG with unknown parameters demonstrates that it is impossible to significantly enhance the security of the system simply by increasing the size of the modulus. Therefore, we are motivated to embed the generated pseudo-random numbers with sensor data messages in order to provide security. Specifically, the security of our proposed cipher is achieved by adding random noise and random permutations to the original data messages. We also adopt the Hull and Dobell’s algorithm to select proper parameters used in the LCG. The analysis of our cipher indicates that it can satisfy the security requirements of wireless sensor networks. We further demonstrate that secure protocols based on our proposed cipher satisfy the baseline security requirements: data confidentiality, authenticity, and integrity with low overhead. Performance analysis demonstrates that our proposed block cipher is more lightweight than RC5, a commonly used cipher in wireless sensor networks, in terms of the number of basic operations.

Applicability of XSL attacks to block ciphers

The applicability of XSL attacks to block ciphers is examined. Some properties are discussed based on a toy cipher example. A method to evaluate a cipher's susceptibility to this attack is suggested with results applied to several currently proposed block ciphers, and a new S-box design criterion is presented.