Abstract

IDEA is a classic symmetric encryption algorithm proposed in 1991 and widely used in many applications. However, there is little research into white-box IDEA. In traditional white-box implementations of existing block ciphers, S-boxes are always converted into encoded lookup tables. However, the algebraic operations of IDEA without S-boxes, make the implementation not straight forward and challenging. We propose a white-box implementation of IDEA by applying a splitting symmetric encryption method, and verify its security against algebraic analysis and BGE-like attacks. Our white-box implementation requires an average of about 2800 ms to encrypt a 64-bit plaintext, about 60 times more than the original algorithm would take, which is acceptable for practical applications. Its storage requirements are only about 10 MB. To our knowledge, this is the first public white-box IDEA solution, and its design by splitting can be applied to similar algebraic encryption structures.

Highlights

  • Since the function of the S-box is replaced by algebraic operations in International Data Encryption Algorithm (IDEA), the core idea of our solution is the transformation of the two arithmetic operations into lookup tables

  • We proposed a scheme to implement the white-box IDEA

  • We focused on the computation of two arithmetic operations in IDEA and developed a method to transform these arithmetic operations into lookup tables (Type I) and embedded four different masks to increase the resistance against white-box attacks (Type II)

Read more

Summary

Introduction

Among many classic symmetric encryption algorithms, the International Data Encryption Algorithm (IDEA) was jointly developed and proposed [1,2,3] in 1991. S-box as the core structure, while IDEA incorporates three different algebraic operations to replace the traditional S-box non-linear function. The key will be included in multiple non-linear operations This special behavior brings new challenges to the design of white-box implementations. Since the size of its lookup tables are relatively large and the algebraic operations are different from IDEA, it is not directly usable for implementing a white-box. There are no other solutions for transforming algebraic operations into lookup tables, and, as far as we know, no white-box IDEA implementation has been proposed. The research into this topic is scant.

Description of IDEA
White-Box Cryptography Techniques and Terminology
Internal Encodings
External Encodings
Masking Technology
White-Box Implementation of IDEA
Generating the Lookup Tables for Group Operations
Incorporating Masks
Generating the Lookup Tables of MA Structure and Adding Another Masks
Eliminating the Masks
Generating the Lookup Tables for Output Transformation
Performance Analysis
Security Analysis
Analysis of the Lookup Tables
BGE-Like Attacks
Conclusions and Discussion
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.