Scholarlink

<p>Different concepts of lightweight XSL-based block ciphers are considered in this article. We stress some important aspects: using tweaks are widespread due to providing more randomization and side-channel protection; key schedules should be nontrivial, but not so complex; S-boxes should have good cryptographic properties and implementation cost, and to resist linear and differential cryptanalysis, it is important to analyze them together with the linear transformation. An interesting observation is that MDS linear transformations appear to be a suboptimal choice. Binary matrices offer a much more efficient implementation, and the number of active S-boxes in an XSL-scheme with a binary matrix proves sufficient. Using MILP method we obtain new binary <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(4 \times 4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>4</mn> <mo>×</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation> matrices that can be implemented with 2 and 3 field XORs and exhibit competitive number of active S-boxes (96 and 102 per 25 rounds resp.) in XSL-scheme.</p>

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

A review of design approaches for lightweight block cryptosystems and new lightweight binary matrices

  • 期刊论文

  • 发表日期：

    2026年2月2日

查看全文
  • Stepan Davydov,
  • Anastasiia Chichaeva,
  • Alexey Drynkin

摘要

Different concepts of lightweight XSL-based block ciphers are considered in this article. We stress some important aspects: using tweaks are widespread due to providing more randomization and side-channel protection; key schedules should be nontrivial, but not so complex; S-boxes should have good cryptographic properties and implementation cost, and to resist linear and differential cryptanalysis, it is important to analyze them together with the linear transformation. An interesting observation is that MDS linear transformations appear to be a suboptimal choice. Binary matrices offer a much more efficient implementation, and the number of active S-boxes in an XSL-scheme with a binary matrix proves sufficient. Using MILP method we obtain new binary \(4 \times 4\) 4 × 4 matrices that can be implemented with 2 and 3 field XORs and exhibit competitive number of active S-boxes (96 and 102 per 25 rounds resp.) in XSL-scheme.