IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i9p1576-d412662.html
   My bibliography  Save this article

A New Automatic Tool Searching for Impossible Differential of NIST Candidate ACE

Author

Listed:
  • Jingyi Liu

    (College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410072, China)

  • Guoqiang Liu

    (College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410072, China)

  • Longjiang Qu

    (College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410072, China)

Abstract

The ACE algorithm is a candidate of the Lightweight Cryptography standardization process started by the National Institute of Standards and Technology (NIST) of the USA that passed the first round and successfully entered the second round. It is designed to achieve a balance between hardware cost and software efficiency for both authenticated encryption with associated data (AEAD) and hashing functionalities. This paper focuses on the impossible differential attack against the ACE permutation, which is the core component of the ACE algorithm. Based on the method of characteristic matrix, we build an automatic searching algorithm that can be used to search for structural impossible differentials and give the optimal permutation for ACE permutation and other SPN ciphers. We prove that there is no impossible differential of ACE permutation longer than 9 steps and construct two 8-step impossible differentials. In the end, we give the optimal word permutation against impossible differential cryptanalysis, which is π ′ = ( 2 , 4 , 1 , 0 , 3 ) , and a safer word XOR structure of ACE permutation.

Suggested Citation

  • Jingyi Liu & Guoqiang Liu & Longjiang Qu, 2020. "A New Automatic Tool Searching for Impossible Differential of NIST Candidate ACE," Mathematics, MDPI, vol. 8(9), pages 1-12, September.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1576-:d:412662
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/9/1576/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/9/1576/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1576-:d:412662. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.