Analyze of LBlock and Razor Lightweight Block Cipher Resistance on Algebraic Attack

The Internet of Things is significantly transforming daily activities and industries. With the growing demand for IoT, IoT security has become a primary concern in the context of information security. As a result, lightweight block cipher algorithms are needed to provide adequate security levels while maintaining optimal performance. Many lightweight block cipher algorithms, such as LBlock and Razor, have been proposed. Both LBlock and Razor have been evaluated through various attacks. However, no security evaluation through algebraic attacks has been performed. Algebraic attacks are essential to evaluate the algebraic properties of the ciphertext. This study performs algebraic attacks on both LBlock and Razor algorithms. The goal is to analyze the nonlinear characteristics of the functions used and the equations representing the ciphertext bits of LBlock and Razor. It was found that the greater the number of rounds used, the higher the degree of the system of equations representing each round's output. The results show that algebraic attacks fail on the LBlock algorithm's third and Razor algorithms' first rounds. Thus, both LBlock and Razor are resistant to algebraic attacks.