A novel cryptosystem based on DNA cryptography and randomly generated mealy machine

The advancement of the Internet of Things (IoT) has promoted the rapid development of low-power and multifunctional sensors. However, it is seriously significant to ensure the security of data transmission of these nodes. Meanwhile, sensor nodes have the characteristics of converting analog signals into digital signals for operation processing in wireless sensor networks (WSNs). Given the particularity of Addition or AND, Rotation, and XOR (ARX) operations, its round function can only be based on the Feistel structure or generalized Feistel structure, otherwise, the process of decryption cannot be completed correctly. Furthermore, the existing ARX ciphers have the problems of only changing half of the plaintext block in one round and iterating for many rounds. In this article, a new logical combination method of generalized Feistel structure and ARX operations is proposed to improve the diffusion speed of ARX ciphers, called Shadow. Shadow overcomes the shortcomings of traditional ARX ciphers that only diffuse half of the block in one round. To ensure the efficiency of the encryption hardware circuit while ensuring the security of the physical-layer signal, we studied the round-based hardware architecture and the serial hardware architecture for Shadow cipher. Particularly, we conducted a series of performance tests on Shadow, including the avalanche effect, FPGA implementation, and ASIC implementation. Also, we conducted a security analysis of the Shadow. As shown by our experiments and comparisons, Shadow is compact in IoT nodes and is of high security against cryptanalysis.

Shadow: A Lightweight Block Cipher for IoT Nodes

A novel cryptosystem based on DNA cryptography, hyperchaotic systems and a randomly generated Moore machine for cyber physical systems

The Internet of Things (IoT) is a broad range of applications enabled by the connection of devices such as sensors, actuators, and monitors accessible through the Internet. Massive IoT device connectivity and vast data transmission have made the information susceptible to various types of attacks. Therefore, encryption is required for secure communication in an IoT ecosystem. An IoT system is constrained by its complexities that require small computing power. Thus, lightweight block cipher is chosen as the solution to IoT security issues. RECTANGLE block cipher has very efficient encryption speed performance among the existing lightweight algorithms. Although RECTANGLE achieves such high efficiency, lack of focus on its security aspect needs to be addressed. The algorithm is short of confusion and diffusion characteristics that should be offered by a block cipher as one of the cryptographic security properties. Therefore, we extended RECTANGLE using a 3D cipher to improve its security features by enhancing the algorithm confusion and diffusion properties. Security analysis and performance tests were performed to verify the strength of the proposed 3D RECTANGLE. The results show that 3D RECTANGLE performs better than its original version in terms of the correlation between data input and output with an increase of 1.58% for non-linearity results, records approximately 50% bit error rate for sensitiveness against both modifications of plaintext and key, increase of passing rate in the randomness test by 22.22%, and achieves competitive performance results against existing algorithms with 0.9516 ms execution speed and 67.26 bit/ms throughput.

/pdf/extended-rectangle-algorithm-using-3d-bit-rotation-to-2u1df0jovm.pdf

Extended RECTANGLE Algorithm Using 3D Bit Rotation to Propose a New Lightweight Block Cipher for IoT

Meet in the middle (MITM) attack is one of the most important and applicable methods for cryptanalysis of block ciphers. In this paper, a more generalized method for MITM attack is considered. For this purpose, a notion, namely cut-set, is utilized by which several numbers of MITM attacks can be performed. However, manual investigation on these cases is time-consuming and sometimes not error-free. Therefore, a new search algorithm is also provided to obtain proper attacks in a timely manner. For examination, this new search algorithm, which could make an automated attack along with some certain ideas, is applied on HIGHT, Piccolo-128, CRAFT and AES-128 block ciphers. The least time complexities which are obtained by generalized MITM attack on full HIGHT, Piccolo-128, CRAFT and AES-128 are 2
 125.08
, 2
 126.78
, 2
 123.25
 and 2
 125.53
, respectively. The results on full-round CRAFT are, to the best of our knowledge, the first cryptanalysis results in the single-key model except the designers' investigations. In addition, the results show some improvements for complexities of all the attacks, especially on HIGHT.

/pdf/generalized-meet-in-the-middle-cryptanalysis-of-block-3m12vlsqdf.pdf

Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm

Mixed integer linear programming (MILP) model was presented by Sun et al. at Asiacrypt 2014 to search for differential characteristics of block ciphers. Based on this model, it is easy to assess block ciphers against differential attack. In this paper, the MILP model is improved to search for differential trails of Midori64 which is a family of lightweight block ciphers provided by Banik et al. at Asiacrypt 2015. We find the best 5-round differential characteristics of Midori64 with MILP-based model, and the probabilities are $2^{-52}$ and $2^{-58}$ respectively. Based on these distinguishers, we give key recovery attacks on the 11-round reduced Midori64 with data complexities of $2^{55.6}$ and $2^{61.2}$ , and time complexities of $2^{109.35}$ and $2^{100.26}$ .

/pdf/milp-based-differential-cryptanalysis-on-round-reduced-ugp1o0ja0q.pdf

MILP-Based Differential Cryptanalysis on Round-Reduced Midori64

GIFT is a family of lightweight block ciphers presented at CHES 2017. Biclique cryptanalysis is proposed to attack the full AES by Bogdanov et al. in ASIACRYPT 2011. The attack can decrease computation complexity using the technology of meet-in-the-middle and reduce data complexity utilising the biclique structure. In this paper, we first provide an unbalanced biclique attack on full round GIFT. The master key has been recovered for the full round GIFT-64 by a 5-round $4\times 16$ unbalanced biclique with data complexity of 2
 16
 and time complexity of 2
 122.95
. Furthermore, a 4-round $8\times 24$ unbalanced biclique is constructed on GIFT-128 to recover the master key with data complexity of 2
 80
 and computational complexity of 2
 118.38
, respectively. The research results show GIFT algorithm has weak immunity to biclique cryptanalysis.

/pdf/unbalanced-biclique-cryptanalysis-of-full-round-gift-32h3pt8fj1.pdf

Hongluan Zhao

Papers

MILP-Based Differential Cryptanalysis on Round-Reduced Midori64

Unbalanced Biclique Cryptanalysis of Full-Round GIFT