Impossible Differential Attack on SAND-64

Nobuyuki Sugio

Paper 2025/636

Impossible Differential Attack on SAND-64

Nobuyuki Sugio

, Hokkaido University of Science

Abstract

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 the Constraint Programming (CP) and reveal 56 types of impossible differential distinguishers up to 11 rounds. Furthermore, we demonstrate a key recovery attack on 17-round SAND-64. The complexities for the attack require data, encryptions, and bytes of memory, respectively. Although this result currently achieves the best attack on round-reduced SAND-64, this attack does not threaten the security of SAND-64 against impossible differential attack.

Metadata

Available format(s): PDF
Category: Attacks and cryptanalysis
Publication info: Preprint.
Keywords: Impossible differential attack lightweight cipher SAND Constraint Programming
Contact author(s): sugio-n @ hus ac jp
History: 2025-04-11: approved; 2025-04-08: received; See all versions
Short URL: https://ia.cr/2025/636
License: CC BY-NC-ND

BibTeX

@misc{cryptoeprint:2025/636,
      author = {Nobuyuki Sugio},
      title = {Impossible Differential Attack on {SAND}-64},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/636},
      year = {2025},
      url = {https://eprint.iacr.org/2025/636}
}