The t-wise independence of substitution-permutation networks

DOI10.1007/978-3-030-84259-8_16zbMATH Open1489.94104OpenAlexW3164186972MaRDI QIDQ2139644FDOQ2139644

Authors: Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan 

Publication date: 18 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_16

Recommendations

• Proving the Security of AES Substitution-Permutation Network
• Provable security of (tweakable) block ciphers based on substitution-permutation networks
• scientific article; zbMATH DE number 1304107
• Tight security for key-alternating ciphers with correlated sub-keys
• Tight security bounds for key-alternating ciphers

zbMATH Keywords

Rijndaelkey-alternating ciphersS-box computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of Boolean Functions
• On the indifferentiability of key-alternating ciphers
• Minimizing the two-round Even-Mansour cipher
• Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
• Title not available (Why is that?)
• Higher Order Derivatives and Differential Cryptanalysis
• Tight security bounds for key-alternating ciphers
• Differential cryptanalysis of DES-like cryptosystems
• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Biclique Cryptanalysis of the Full AES
• Title not available (Why is that?)
• Perfect nonlinear functions and cryptography
• Security analysis of key-alternating Feistel ciphers
• On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
• Provable security against a differential attack
• Markov Ciphers and Differential Cryptanalysis
• Decorrelation: a theory for block cipher security
• Advanced Encryption Standard – AES
• Improving the upper bound on the maximum differential and the maximum linear hull probability for SPN structures and AES.
• The interpolation attack on block ciphers
• Title not available (Why is that?)
• Proving the Security of AES Substitution-Permutation Network
• Title not available (Why is that?)
• Generators for Certain Alternating Groups with Applications to Cryptography
• An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
• A weak cipher that generates the symmetric group
• Simple permutations mix well
• Simple permutations mix even better
• Indistinguishability Amplification
• Understanding Two-Round Differentials in AES
• Provable security of (tweakable) block ciphers based on substitution-permutation networks
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Indifferentiability of confusion-diffusion networks
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• Tight security analysis of 3-round key-alternating cipher with a single permutation
• A synthetic indifferentiability analysis of interleaved double-key Even-Mansour ciphers
• Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
• Title not available (Why is that?)

Cited In (10)

• Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
• Provable security of (tweakable) block ciphers based on substitution-permutation networks
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• Sequential indifferentiability of confusion-diffusion networks
• Proving the Security of AES Substitution-Permutation Network
• Title not available (Why is that?)
• Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
• On a generalization of substitution-permutation networks: the HADES design strategy
• Avalanche characteristics of substitution-permutation encryption networks
• Tight security for key-alternating ciphers with correlated sub-keys

Uses Software

• MiMC

This page was built for publication: The \(t\)-wise independence of substitution-permutation networks

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