In this paper, we investigate the neutral bits used in ARX ciphers from the perspective of the boomerang connectivity table. Two propositions are employed to obtain the probability of neutral bits for modular additions, and their proofs are given so that the probabilities can be calculated theoretically for the first time. Then, we apply our method to the neutral bits for neural-differential cryptanalysis of Speck, verify the probabilities, and find some neutral bits not used in previous works. This method is also utilized to reevaluate the probability of neutral bits for differential cryptanalysis of ChaCha. What’s more, a new notion named truncated boomerang connectivity table (TBCT) is also proposed to formalize the calculation of probabilities in the case of truncated differentials.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Note on Neutral Bits for ARX Ciphers from the Perspective of BCT

  • Jiahao Zhao,
  • Qianqian Yang,
  • Ling Song,
  • Lei Hu

摘要

In this paper, we investigate the neutral bits used in ARX ciphers from the perspective of the boomerang connectivity table. Two propositions are employed to obtain the probability of neutral bits for modular additions, and their proofs are given so that the probabilities can be calculated theoretically for the first time. Then, we apply our method to the neutral bits for neural-differential cryptanalysis of Speck, verify the probabilities, and find some neutral bits not used in previous works. This method is also utilized to reevaluate the probability of neutral bits for differential cryptanalysis of ChaCha. What’s more, a new notion named truncated boomerang connectivity table (TBCT) is also proposed to formalize the calculation of probabilities in the case of truncated differentials.