Skip to content
Open access

Equivalence of XOR and XNOR in differential cryptanalysis: application to SCAN-C

Aug 2026 · Cybersecurity · Vol 9 · 0 citations · 26 references

TL;DR

This work presents the first full-round differential cryptanalysis of SCAN-C, demonstrating that its unique XNOR-based key mixing provides no additional security margin and is the first to show that differential cryptanalysis is equivalent under both XOR and XNOR difference definitions.

Abstract

SCAN-C is a lightweight block cipher featuring a hybrid Feistel-SPN structure designed for Controller Area Network (CAN) security. This work presents the first full-round differential cryptanalysis of SCAN-C, demonstrating that its unique XNOR-based key mixing provides no additional security margin. We also prove that XNOR-based mixing is structurally equivalent to standard XOR mixing, as the corresponding difference distribution tables (DDTs) differ only by a permutation of indices. Utilizing an SMT-based automated search, we identify optimal differential clusters, including a 9-round distinguisher with a probability of 2-51.30\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{-51.30}$$\end{document}. By extending these results, we show that the complete internal key state can be recovered through the recovery of all 12 round keys, requiring around 255\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{55}$$\end{document} chosen plaintexts and 269\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{69}$$\end{document} encryptions. Our results confirm that the current 12-round specification is insufficient for security and is the first to show that differential cryptanalysis is equivalent under both XOR and XNOR difference definitions.

Read PDF

Similar papers

Open access Oct 2026

Differential-linear cryptanalysis against ChaCha based on automated tools

ChaCha is a widely deployed ARX stream cipher used in modern secure-communication protocols. Reduced-round cryptanalysis assesses its security margin and tests automated methods without implying a threat to the full 20-round cipher. We combine MILP search, GPU correlation estimation, and MIQCP-based prediction. MILP fi...

Guo-Qiang Liu, Gui-Yan Ren, Bing Sun et al. · 0 citations
Open access Sep 2026

A hyperchaotic image encryption paradigm fusing DNA sequence operations with bit-level multi-stage dynamic scrambling

Recently, the increasing severity of data breaches has made the security of digital images, as high-capacity visual information carriers, a critical concern. While chaotic maps are widely applied in image encryption due to their high nonlinearity and sensitivity, many existing schemes suffer from degraded chaotic prope...

S. Kareem, Mardan A. Pirdawood · 0 citations
Open access Aug 2026

Revisiting differential-linear cryptanalysis of lightweight cipher Schwaemm

Schwaemm is a member of the Sparkle-suite, a family of lightweight symmetric cryptographic algorithms that advanced to finalist status in the NIST lightweight cryptography standardization process. In 2023, using differential-linear cryptanalysis, Xiong and Liu presented a practical 4-round distinguisher and a theoretic...

Jiajun Zhou, Zhicheng Xiong, Zhen-Zhen Bao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.