<p>We classify small binary bibraces, using the correspondence with alternating algebras over the field <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathbb F_2\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation>, up to dimension eight, also determining their isomorphism classes. These finite-dimensional algebras, defined by an alternating bilinear multiplication and nilpotency of class two, can be represented by subspaces of skew-symmetric matrices, with classification corresponding to <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\({{\,\textrm{GL}\,}}(m, \mathbb F_2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.166667em" /> <mtext>GL</mtext> <mspace width="0.166667em" /> </mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <msub> <mi mathvariant="double-struck">F</mi> <mn>2</mn> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-orbits under congruence. Our approach combines theoretical invariants, such as rank sequences and the identification of primitive algebras, with computational methods implemented in <Emphasis FontCategory="NonProportional">Magma</Emphasis>. These results also count the number of possible alternative operations that can be used in differential cryptanalysis.</p>

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

Classification of small binary bibraces via bilinear maps

  • Roberto Civino,
  • Valerio Fedele

摘要

We classify small binary bibraces, using the correspondence with alternating algebras over the field \(\mathbb F_2\) F 2 , up to dimension eight, also determining their isomorphism classes. These finite-dimensional algebras, defined by an alternating bilinear multiplication and nilpotency of class two, can be represented by subspaces of skew-symmetric matrices, with classification corresponding to \({{\,\textrm{GL}\,}}(m, \mathbb F_2)\) GL ( m , F 2 ) -orbits under congruence. Our approach combines theoretical invariants, such as rank sequences and the identification of primitive algebras, with computational methods implemented in Magma. These results also count the number of possible alternative operations that can be used in differential cryptanalysis.