Journal on Communications ›› 2020, Vol. 41 ›› Issue (1): 94-101.doi: 10.11959/j.issn.1000-436x.2020025

• Papers • Previous Articles     Next Articles

Impossible differential distinguisher analysis of GRANULE and MANTRA algorithm

Xiaonian WU1,2,Yingxin LI1,3,Yongzhuang WEI1,Yaping SUN1   

  1. 1 Guangxi Key Laboratory of Cryptography and Information Security,Guilin University of Electronic Technology,Guilin 541004,China
    2 Science and Technology on Communication Security Laboratory,Chengdu 610041,China
    3 Guangxi Colleges Key Laboratory of Cloud Computing and Complex Systems,Guilin 541004,China
  • Revised:2019-12-12 Online:2020-01-25 Published:2020-02-11
  • Supported by:
    The Foundation of Science and Technology on Communication Security Laboratory(6142103190103);The National Natural Science Foundation of China(61572148);The National Natural Science Foundation of China(61872103);The Key Research and Development Plan of Guangxi(AB18281019);The Natural Science Foundation of Guangxi(2018GXNSFAA294036);Guangxi Key Laboratory of Cryptography and Information Security(GCIS201705);Guangxi Colleges Key Laboratory of Cloud Computing and Complex Systems(YF16205);The Innovation Project of Guangxi Graduate Education(YCSW2018138);The Innovation Project of Guangxi Graduate Education(YCBZ2018051)

Abstract:

The lightweight block cipher algorithms called GRANULE and MANTRA have a simple structure,fast encryption speed,and they can be easy implemented in software and hardware.Two algorithms are especially suitable for resource-constrained environments.To analyze the security of two algorithms,an automatic search method of impossible differential distinguishers was proposed.Based on the structural characteristics of the GRANALE and MANTRA,the S-box differential characteristics were obtained by analyzing the S-box differential distribution table,and then the idea of intermediate encounter was used to traverse from the difference path obtained from the encryption/decryption direction seperately to select the optimal differential path with probability 0.The analysis results show that there are 144 different 7-round impossible differential distinguishers in the GRANULE,and 52 different 9-round impossible differential distinguishers in the MANTRA.Compared with the existing results,the rounds of the proposed distinguisher is currently the highest.

Key words: lightweight block cipher algorithm, S-box, impossible differential distinguisher, automatic search

CLC Number: 

No Suggested Reading articles found!