Scholarlink

SAND is an AND-RX-based lightweight block cipher proposed by Chen et al. There are two variants of SAND, namely SAND-64 and SAND-128, due to structural differences. In this paper, we search for impossible differential distinguishers of SAND-64 using Constraint Programming (CP) and reveal 56 types of impossible differential distinguishers up to 11 rounds. Furthermore, we demonstrate a key recovery attack on 16-round SAND-64. The complexities for the attack require \(2^{63}\) data, \(2^{96}\) encryptions, and \(2^{62}\) bytes of memory, respectively.

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

Impossible Differential Attack on SAND-64

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Nobuyuki Sugio

摘要

SAND is an AND-RX-based lightweight block cipher proposed by Chen et al. There are two variants of SAND, namely SAND-64 and SAND-128, due to structural differences. In this paper, we search for impossible differential distinguishers of SAND-64 using Constraint Programming (CP) and reveal 56 types of impossible differential distinguishers up to 11 rounds. Furthermore, we demonstrate a key recovery attack on 16-round SAND-64. The complexities for the attack require \(2^{63}\) data, \(2^{96}\) encryptions, and \(2^{62}\) bytes of memory, respectively.