• Title/Summary/Keyword: Sasaki

Search Result 271, Processing Time 0.027 seconds

MILP-Espresso-Based Automatic Searching Method for Differential Charactertistics (효율적인 MILP-Espresso 기반 차분 특성 자동 탐색 방법)

  • Park, YeonJi;Lee, HoChang;Hong, Deukjo;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.3
    • /
    • pp.533-543
    • /
    • 2018

  • In this paper, we propose an MILP-based method for Optimal Probability of Bit-based Differential Characteristic in SP(Substitution-permutation) ciphers based on Automatic Differential Characteristic Searching Method of Sasaki, et al. In [13], they used input/output variables and probability variables seperatably, but we simplify searching procedure by putting them(variables) together into linear inequalities. Also, In order to decrease the more linear inequalities, we choose Espresso algorithm among that used by Sasaki, et al(Quine-McCluskey algorithm & Espresso algorithm). Moreover, we apply our method to GIFT-64, GIFT-128, SKINNY-64, and we obtained results in the GIFT(Active S-boxs : 6, Probabilities : $2^{-11.415}$) compared with the existing one.(Active S-boxs : 5, Probabilities : unknown). In case of SKINNY-64, we can't find better result, but can find same result compared with the existing one.

  • https://doi.org/10.13089/JKIISC.2018.28.3.533 인용 PDF KSCI HTML