Improved neural distinguishers with multi-round and multi-splicing construction

被引:8
|
作者
Liu, JiaShuo [1 ]
Ren, JiongJiong [1 ]
Chen, ShaoZhen [1 ]
Li, ManMan [1 ]
机构
[1] Informat Engn Univ, Zhengzhou, Peoples R China
关键词
Deep learning; Block cipher; Neural distinguisher; Speck; Simon;
D O I
10.1016/j.jisa.2023.103461
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In CRYPTO 2019, Gohr successfully applied deep learning to differential cryptanalysis against the NSA block cipher Speck32/64, achieving higher accuracy than traditional differential distinguishers. Until now, the improvement of neural differential distinguishers is a mainstream research direction in neural-aided cryptanalysis. But the current development of training data formats for neural distinguishers forms barriers: (1) The source of data features is limited to linear combinations of ciphertexts, which does not provide more learnable features to the training samples for improving the neural distinguishers. (2) Lacking breakthroughs in constructing data format for network training from the deep learning perspective. In this paper, considering both the domain knowledge about deep learning and information on differential cryptanalysis, we use the output features of the penultimate round to proposing a two-dimensional and non-realistic input data generation method of neural differential distinguishers. Then, we validate that the proposed new input data format has excellent features through experiments and theoretical analysis. Moreover, combining the idea of multiple ciphertext pairs, we generate two specific models for data input construction: MRMSP(Multiple Rounds Multiple Splicing Pairs) and MRMSD(Multiple Rounds Multiple Splicing Differences) and then build new neural distinguishers against Speck and Simon family, which effectively improve the performance compared with the previous works. To the best of our knowledge, our neural distinguishers achieve the longest rounds and the higher accuracy for NSA block ciphers Speck and Simon.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Multi-Round Influence Maximization
    Sun, Lichao
    Huang, Weiran
    Yu, Philip S.
    Chen, Wei
    KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 2249 - 2258
  • [2] The Multi-round Process Matrix
    Hoffreumon, Timothee
    Oreshkov, Ognyan
    QUANTUM, 2021, 5
  • [3] Multi-round anonymous auction protocols
    Kikuchi, H
    Hakavy, M
    Tygar, D
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1999, E82D (04): : 769 - 777
  • [4] On Multi-Round Privacy in Federated Learning
    Deer, August
    Ali, Ramy E.
    Avestimehr, A. Salman
    2022 56TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2022, : 764 - 769
  • [5] Multi-Round Recommendations for Stable Groups
    Heiska, Ilmo
    Stefanidis, Kostas
    PROCEEDINGS OF THE 2021 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATICS AND COMPUTING (PIC), 2021, : 232 - 240
  • [6] Scalable Multi-Round Multi-Party Privacy-Preserving Neural Network Training
    Lu, Xingyu
    Basaran, Umit Yigit
    Guler, Basak
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (11) : 8204 - 8236
  • [7] ALGERIAN MULTI-ROUND DEMOGRAPHIC SURVEY
    NEGADI, G
    TABUTIN, D
    POPULATION, 1971, 26 (06): : 1135 - 1143
  • [8] CDS Composition of Multi-round Protocols
    Abe, Masayuki
    Bogdanov, Andrej
    Ohkubo, Miyako
    Rosen, Alon
    Shang, Zehua
    Tibouchi, Mehdi
    ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT IX, 2024, 14928 : 391 - 423
  • [9] On Multi-Round Sensor Deployment for Barrier Coverage
    Eftekhari, Mohsen
    Narayanan, Lata
    Opatrny, Jaroslav
    2013 IEEE 10TH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS (MASS 2013), 2013, : 310 - 318
  • [10] Resource Sharing Through Multi-Round Matchings
    Trabelsi, Yohai
    Adiga, Abhijin
    Kraus, Sarit
    Ravi, S. S.
    Rosenkrantz, Daniel J.
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023, : 11681 - 11690