• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xie Gaoqi, Wei Hongru. Impossible Differential Attack of Block Cipher ARIA[J]. Journal of Computer Research and Development, 2018, 55(6): 1201-1210. DOI: 10.7544/issn1000-1239.2018.20170275
Citation: Xie Gaoqi, Wei Hongru. Impossible Differential Attack of Block Cipher ARIA[J]. Journal of Computer Research and Development, 2018, 55(6): 1201-1210. DOI: 10.7544/issn1000-1239.2018.20170275

Impossible Differential Attack of Block Cipher ARIA

More Information
  • Published Date: May 31, 2018
  • ARIA cipher is a new block cipher proposed by some South Korean experts in 2003. The design principle of ARIA is similar to the AES, and it has relatively high security. ARIA was established as a Korean Standard block cipher algorithm by Korean Agency for Technology and Standards in 2004. Combining the features of ARIA algorithm, a new impossible differential attack on 7-round ARIA is proposed by adding 2-round at the beginning and 1-round at the end. It is shown that this new impossible differential attack requires a data complexity of about 2\+\{119\}chosen plaintexts and a time complexity of about 2\+\{218\}7-round ARIA encryptions. Compared with the previous impossible differential attacks, this attack efficiently reduces the data complexity and time complexity. Similar to the attack of 7-round, a new impossible differential attack on 8-round ARIA is proposed first time by adding 2-round at the beginning and 2-round at the end. It is shown that this new impossible differential attack requires a data complexity of about 2\+\{207\} chosen plaintexts and a time complexity of about 2\+\{346\}8-round ARIA encryptions. It has exceeded the attack complexity of exhaustive search attack, so we can believe that ARIA cryptographic algorithm is safe in this path of 8-round impossible differential attack.
  • Related Articles

    [1]Xia Qing, Li Shuai, Hao Aimin, Zhao Qinping. Deep Learning for Digital Geometry Processing and Analysis: A Review[J]. Journal of Computer Research and Development, 2019, 56(1): 155-182. DOI: 10.7544/issn1000-1239.2019.20180709
    [2]Xu Xiao, Ding Shifei, Sun Tongfeng, Liao Hongmei. Large-Scale Density Peaks Clustering Algorithm Based on Grid Screening[J]. Journal of Computer Research and Development, 2018, 55(11): 2419-2429. DOI: 10.7544/issn1000-1239.2018.20170227
    [3]Sun Yong, Tan Wenan, Jin Ting, Zhou Liangguang. A Collaborative Collusion Detection Method Based on Online Clustering[J]. Journal of Computer Research and Development, 2018, 55(6): 1320-1332. DOI: 10.7544/issn1000-1239.2018.20170231
    [4]Xu Kai, Wu Xiaojun, Yin Hefeng. Distributed Low Rank Representation-Based Subspace Clustering Algorithm[J]. Journal of Computer Research and Development, 2016, 53(7): 1605-1611. DOI: 10.7544/issn1000-1239.2016.20148362
    [5]Zhang Shuai, Li Tao, Jiao Xiaofan, Wang Yifeng, Yang Yulu. Parallel TNN Spectral Clustering Algorithm in CPU-GPU Heterogeneous Computing Environment[J]. Journal of Computer Research and Development, 2015, 52(11): 2555-2567. DOI: 10.7544/issn1000-1239.2015.20148151
    [6]Zhu Hong, Ding Shifei, Xu Xinzheng. An AP Clustering Algorithm of Fine-Grain Parallelism Based on Improved Attribute Reduction[J]. Journal of Computer Research and Development, 2012, 49(12): 2638-2644.
    [7]Lu Weiming, Du Chenyang, Wei Baogang, Shen Chunhui, and Ye Zhenchao. Distributed Affinity Propagation Clustering Based on MapReduce[J]. Journal of Computer Research and Development, 2012, 49(8): 1762-1772.
    [8]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [9]Luo Xiaonan, Lin Mouguang, Ji Changbo, and Li Zhiyong. A Progressive Geometry Simplification Method for Mobile Computing Terminal[J]. Journal of Computer Research and Development, 2007, 44(6): 1038-1043.
    [10]Ou Xinliang, Chen Songqiao, Chang Zhiming. A Parallel Geometric Correction Algorithm Based on Dynamic Division-Point Computing[J]. Journal of Computer Research and Development, 2006, 43(6): 1115-1121.

Catalog

    Article views (1649) PDF downloads (598) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return