An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers

DOI10.4213/mvk358zbMath1486.94118OpenAlexW4248890509WikidataQ121365422 ScholiaQ121365422MaRDI QIDQ5071465

V. A. Kiryukhin

Publication date: 21 April 2022

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk368

zbMATH Keywords

LSXdifferential cryptanalysisSPNKuznyechikMEDPMELP

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• Differential Attacks Against SPN: A Thorough Analysis
• On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
• Рассеивающие свойства XSLP-шифров
• Exact maximum expected differential and linear probability for $2$-round Kuznyechik
• Linear and differential cryptanalysis: Another viewpoint
• Markov Ciphers and Differential Cryptanalysis
• Advanced Encryption Standard – AES
• Fast Software Encryption

This page was built for publication: An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers