scientific article; zbMATH DE number 1808212

MaRDI QIDQ3149674zbMATH OpenFDO

Authors Liam Keliher, Henk Meijer, Stafford E. Tavares

Publication date 3 December 2002

zbMATH Keywords

linear cryptanalysisprovable securitysubstitution-permutation networksmaximum average linear hull probability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2085199
• Improving the upper bound on the maximum differential and the maximum linear hull probability for SPN structures and AES.
• Differential and linear cryptanalysis for 2-round spns
• On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
• New Method for Bounding the Maximum Differential Probability for SPNs and ARIA

Cited in

(17)

• Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes
• Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
• scientific article; zbMATH DE number 2085199 (Why is no real title available?)
• On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
• The \(t\)-wise independence of substitution-permutation networks
• On linear hulls and trails
• Provable security of block ciphers against linear cryptanalysis: a mission impossible?
• Differential and linear cryptanalysis for 2-round spns
• New upper bound on the maximum differential probability for SPS structure with P-box using \(n\)-MDS
• Computing expected differential probability of (truncated) differentials and expected linear potential of (multidimensional) linear hulls in SPN block ciphers
• On Efficient Message Authentication Via Block Cipher Design Techniques
• Advanced Encryption Standard – AES
• ASC-1: an authenticated encryption stream cipher
• Improving the upper bound on the maximum differential and the maximum linear hull probability for SPN structures and AES.
• FPGA implementation of a statistical saturation attack against PRESENT
• An algorithm for computing the upper bound for non-minimum weight differentials in 2-round LSX-ciphers
• New Method for Bounding the Maximum Differential Probability for SPNs and ARIA

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149674)