On the guaranteed number of activations in $\mathsf{XS}$-circuits

DOI10.4213/mvk353zbMath1486.94072OpenAlexW4250306723MaRDI QIDQ5071454

Sergey Agievich

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/mvk353

zbMATH Keywords

linear codecircuitdifferential cryptanalysislinear recurrence sequencelinear cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Uses Software

• MiMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security of SM4 against (related-key) differential cryptanalysis
• Generalized Feistel networks revisited
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
• On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
• $\mathsf{XS}$-circuits in block ciphers
• Fundamentals of Error-Correcting Codes
• The Wide Trail Design Strategy

This page was built for publication: On the guaranteed number of activations in $\mathsf{XS}$-circuits