Abstract

With technical development and internet popularization, Internet of Things (IoT) technology is gaining a wider application in various fields. Key challenges in the growth of IoT are related to privacy and security. To avoid any possible malicious attacks, employing cryptosystems is widely recognized as one of the most effective approaches to implement confidentiality, integrity, and message authentication for the security of IoT. In this work, we investigate the security of Authenticated Encryption ciphers and stream cipher by using the improved cube attack. Firstly, we introduce a method to identify good cubes, which leads to the largest-round distinguisher. Our idea is based on the greedy algorithm of finding cubes and the numeric mapping method for estimating the algebraic degree of the NFSR-based cryptosystem. By using this method, we can efficiently explore useful cubes from a large search space. Further, we evaluate the security of several cryptographic primitives against the cube attack by using the SAT model of division property and flag technique, which can make the propagation of division property more accurately. Experiments show that we can obtain some new or improved cryptanalysis on MORUS-640-128, TRIAD, Quartet, TriviA-ck-v2, and Enhanced-bivium. The attacks can improve the number of attacking rounds and efficiency, and provide a vital reference for security analysis of other Authenticated Encryption ciphers and lightweight stream ciphers.

Highlights

  • With the rapid development and the wide use of Internet of Things (IoT), there is a huge amount of data transferred over a network in order to communicate and share information

  • To create worthy solutions to the problem of securing data in the IoT-like constrained environments, National Institute of Standards and Technology (NIST) published the call in August 2018 [2] for proposals for a new lightweight cryptography (LWC) standard process for lightweight applications

  • We use the algorithm combined with the SAT model of the division property and the flag technique to improve the accuracy of the propagation of division properties

Read more

Summary

INTRODUCTION

With the rapid development and the wide use of IoT, there is a huge amount of data transferred over a network in order to communicate and share information. With the help of bitbased division property using three subsets, Wang et al [29] apply their improved cube attack technique on Trivium in practice and propose a theoretical attack that can recover the superpoly of Trivium up to 842 rounds. We evaluate the security of MORUS-640-128, TRIAD, Quartet, Trivia-ck-v2, and Enhanced-bivium by using the improved cube attack based on the division property with the SAT method, and we give some new cryptanalysis results in key recovery attack. For MORUS-640-128 with keystream generation function, we give the first 5.9-step key recovery attack with a cube of size 24, which achieves 0.4-step (two rounds) more than the previous best work in [34], and the complexity for superpoly recovery is 232.06.

ORGANIZATION The remainder of this paper is organized as follows
CUBE ATTACK
SAT-AIDED BIT-BASED DIVISION PROPERTY
CUBE ATTACK BASED ON DIVISION PROPERTY
THE DESCRIPTION OF MORUS-640-128
METHODS
THE NUMERIC MAPPING TECHNIQUE
A NEW GREEDY ALGORITHM TO FIND EXPECTED CUBES
COMBINATION OF SAT MODEL AND FLAG TECHNIQUE
APPLICATIONS
APPLICATIONS TO MORUS-640-128
1: Declare cube indexes I
APPLICATIONS TO TRIVIA-CK-V2
APPLICATIONS TO ENHANCED-BIVIUM
Findings
CONCLUSION AND FUTURE WORK
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call