We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 28 Issue 1
January  2013
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Shu-Sheng Liu, Zheng Gong, Li-Bin Wang. Cryptanalysis of Reduced-Round DASH[J]. Journal of Computer Science and Technology, 2013, 28(1): 159-164. DOI: 10.1007/s11390-013-1320-x
Citation: Shu-Sheng Liu, Zheng Gong, Li-Bin Wang. Cryptanalysis of Reduced-Round DASH[J]. Journal of Computer Science and Technology, 2013, 28(1): 159-164. DOI: 10.1007/s11390-013-1320-x
shu

Cryptanalysis of Reduced-Round DASH

  • School of Computer Science, South China Normal University, Guangzhou 510631, China

Funds: The work is supported by the National Natural Sciences Foundation of China under Grant No. 61100201 and Foundation for Distinguished Young Talents in Higher Education of Guangdong Province of China under Grant No. LYM11053.
More Information
  • Received Date: February 26, 2012
  • Revised Date: June 28, 2012
  • Published Date: January 04, 2013
    Abstract
  • In ACISP 2008, the hash family DASH has been proposed by Billet et al., which considers the design of Rijndael and RC6. DASH family has two variants that support 256-bit and 512-bit output length respectively. This paper presents the first third-party cryptanalysis of DASH-256 with a focus on the underlying block cipher A256. In particular, we study the distinguisher using differential and boomerang attack. As a result, we build a distinguishing attack for the compression function of DASH-256 with 8-round A256 using the differential cryptanalysis. Finally, we obtain a boomerang distinguisher of 9-round A256.
    • FullText(HTML)
    • References (10)
  • [1]
    Wang X Y, Lai X J, Feng D G, Chen H, Yu X Y. Cryptanalysisof the hash functions MD4 and RIPEMD. In Proc. the24th EUROCRYPT 2005, May 2005, pp.1-18.
    [2]
    Wang X Y, Yin Y L, Yu H B. Finding collisions in the fullSHA-1. In Proc. the 25th CRYPTO 2005, August 2005,pp.17-36.
    [3]
    Wang X Y, Yu H B. How to break MD5 and other hash functions.In Proc. the 24th EUROCRYPT 2005, May 2005,pp.19-35.
    [4]
    Wang X Y, Yu H B, Yin Y L. Efficient collision search attackson SHA-0. In Proc. the 25th CRYPTO 2005, August 2005,pp.1-16.
    [5]
    Billet O, Robshaw M J B, Seurin Y, Yin Y L. Looking backat a new hash function. In Proc. the 13th ACISP 2008, July2008, pp.239-253.
    [6]
    National Institute of Standards and Technology(NIST). Advanced encryption standard (AES).http://csrc.nist.gov/publications/fips197/fips-197.pdf.
    [7]
    Rivest R L, Robshaw M J B, Sidney R, Yin Y L.The RC6TM block cipher (V1.1), August 20, 1998,www.people.csail.mit.edu/rivest/pubs/RRSY98.pdf.
    [8]
    Wagner D. The Boomerang attack. In Proc. the 6th FSE,March 1999, pp.156-170.
    [9]
    Biryukov A, Nikolic I, Roy A. Boomerang attacks on BLAKE-32. In Proc. the 18th FSE, February 2011, pp.218-237.
    [10]
    Lamberger M, Mendel F. Higher-order differential attackon reduced SHA-256. Cryptology ePrint Archive, Report2011/037, 2011, http://eprint.iacr.org/2011/037.
    • Relative Articles

  • Related Articles

    [1]Yuan Yao, Bin Zhang, Wen-Ling Wu. Utilizing Probabilistic Linear Equations in Cube Attacks[J]. Journal of Computer Science and Technology, 2016, 31(2): 317-325. DOI: 10.1007/s11390-016-1629-3
    [2]Long Wen, Mei-Qin Wang, Jing-Yuan Zhao. Related-Key Impossible Differential Attack on Reduced-Round Lblock[J]. Journal of Computer Science and Technology, 2014, 29(1): 165-176. DOI: 10.1007/s11390-013-1419-0
    [3]Gao-Li Wang. Collision Attack on the Full Extended MD4 and Pseudo-Preimage Attack on RIPEMD[J]. Journal of Computer Science and Technology, 2013, 28(1): 129-143. DOI: 10.1007/s11390-013-1317-5
    [4]Fu-Guo Zhang. Preventing Recommendation Attack in Trust-Based Recommender Systems[J]. Journal of Computer Science and Technology, 2011, 26(5): 823-828. DOI: 10.1007/s11390-011-0181-4
    [5]Hamid Mala, Mohammad Dakhilalian, Mohsen Shakiba. Impossible Differential Attacks on 13-Round CLEFIA-128[J]. Journal of Computer Science and Technology, 2011, 26(4): 744-750. DOI: 10.1007/s11390-011-1173-0
    [6]Ji-Qiang Lv. Differential Attack on Five Rounds of the SC2000 Block Cipher[J]. Journal of Computer Science and Technology, 2011, 26(4): 722-731. DOI: 10.1007/s11390-011-1171-2
    [7]Ya-Fei Yang, Qin-Yuan Feng, Yan (Lindsay) Sun, Ya-Fei Dai. Dishonest Behaviors in Online Rating Systems: Cyber Competition, Attack Models, and Attack Generator[J]. Journal of Computer Science and Technology, 2009, 24(5): 855-867.
    [8]Wen-Ling Wu, Wen-Tao Zhang, Deng-Guo Feng. Impossible Differential Cryptanalysis of Reduced-Round ARIA and Camellia[J]. Journal of Computer Science and Technology, 2007, 22(3): 449-456.
    [9]Jie Liang, Xue-Jia Lai. Improved Collision Attack on Hash Function MD5[J]. Journal of Computer Science and Technology, 2007, 22(1): 79-87.
    [10]XU Ke, WU Jianping, YU Zhongchao, XU Mingwei. A Non-Collision Hash Trie-Tree Based Fast IP Classification Algorithm[J]. Journal of Computer Science and Technology, 2002, 17(2).
    • Supplements (0)

  • Cited by

    Periodical cited type(5)

    1. Keming Huang, Mingwei Li, Jiaqi Song, et al. Layered centrality tournament ranking: To rank nodes in multilayer networks. International Journal of Modern Physics C, 2025. DOI:10.1142/S0129183125500445
    2. Zeang Sheng, Wentao Zhang, Yangyu Tao, et al. OUTRE: An OUT-of-Core De-REdundancy GNN Training Framework for Massive Graphs within A Single Machine. Proceedings of the VLDB Endowment, 2024, 17(11): 2960. DOI:10.14778/3681954.3681976
    3. Bilal Abu-Salih, Salihah Alotaibi. Knowledge Graph Construction for Social Customer Advocacy in Online Customer Engagement. Technologies, 2023, 11(5): 123. DOI:10.3390/technologies11050123
    4. Dong Wu. Digital Media Information Recommendation Model based on Artificial Intelligence Technology. 2024 International Conference on Distributed Computing and Optimization Techniques (ICDCOT), DOI:10.1109/ICDCOT61034.2024.10515981
    5. Muder Almiani, Bilal Abu-Salih, Salihah Alotaibi, et al. Knowledge Graph Embedding for Detecting Brand Advocates in Online Social Networks. 2024 Fifth International Conference on Intelligent Data Science Technologies and Applications (IDSTA), DOI:10.1109/IDSTA62194.2024.10747006

    Other cited types(0)

Catalog

    Get Citation
    PDF
    XML
    Article views (27) PDF downloads (1309) Cited by(5)
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return