Scholarlink

<p>The differential branch number is a key parameter used to measure the diffusion ability of a permutation. It is of great significance to study the upper bound of the differential branch number of permutations. This paper analyses the existence problem of binary codes with a specified dimension and minimum distance using combinatorial inequality. The result obtained is used to estimate the differential branch number of permutations on <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="42400_2025_357_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathbb{G}\mathbb{F}(2)}^n\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="double-struck">G</mi> <mi mathvariant="double-struck">F</mi> <mo stretchy="false">(</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> <mi>n</mi> </msup> </math></EquationSource> </InlineEquation> associated with those codes, and this paper finally finds two upper bounds, one of which is the tightest upper bound currently known. Furthermore, inspired by the comparison between two specific bounds mentioned above, the asymptotic upper bound of the differential branch number is studied. The conclusion quantitatively illustrates the relation between the upper bound and the range of <i>n</i>. It is shown that when <i>n</i> is sufficiently large, the differential branch number of <i>n</i>-bit permutations has an asymptotic upper bound of 0.44012<i>n</i>. This is also the most accurate upper bound that can be proved using the scheme presented in this paper.</p>

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

Upper bounds of differential branch number of \(n\)-bit permutations

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年5月8日

查看全文
  • Ying Gao,
  • Lin Qi

摘要

The differential branch number is a key parameter used to measure the diffusion ability of a permutation. It is of great significance to study the upper bound of the differential branch number of permutations. This paper analyses the existence problem of binary codes with a specified dimension and minimum distance using combinatorial inequality. The result obtained is used to estimate the differential branch number of permutations on \({\mathbb{G}\mathbb{F}(2)}^n\) G F ( 2 ) n associated with those codes, and this paper finally finds two upper bounds, one of which is the tightest upper bound currently known. Furthermore, inspired by the comparison between two specific bounds mentioned above, the asymptotic upper bound of the differential branch number is studied. The conclusion quantitatively illustrates the relation between the upper bound and the range of n. It is shown that when n is sufficiently large, the differential branch number of n-bit permutations has an asymptotic upper bound of 0.44012n. This is also the most accurate upper bound that can be proved using the scheme presented in this paper.