Provable security of (tweakable) block ciphers based on substitution-permutation networks

DOI10.1007/978-3-319-96884-1_24MaRDI QIDQ1673418zbMATH OpenOpenAlexFDO

Authors Benoît Cogliati, Yevgeniy Dodis, Jooyoung Lee, Aishwarya Thiruvengadam, Zhe Zhang, Jonathan Katz, John P. Steinberger

Publication date 12 September 2018

Full work available at URL http://orbilu.uni.lu/handle/10993/42328

zbMATH Keywords

beyond-birthday-bound securitydomain extension of block cipherssubstitution-permutation networkstweakable block ciphers

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1304107
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• The \(t\)-wise independence of substitution-permutation networks
• Proving the Security of AES Substitution-Permutation Network
• Differential and linear cryptanalysis for 2-round spns

Cited in

(23)

• On a generalization of substitution-permutation networks: the HADES design strategy
• The \(t\)-wise independence of substitution-permutation networks
• Beyond-birthday security for permutation-based Feistel networks
• Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher
• scientific article; zbMATH DE number 1304107 (Why is no real title available?)
• Pseudorandom functions: three decades later
• Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol
• Invariant subspaces in SPN block cipher
• Proving the Security of AES Substitution-Permutation Network
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• Indifferentiability of the confusion-diffusion network and the cascade block cipher
• On perfect linear approximations and differentials over two-round SPNs
• Layout graphs, random walks and the t-wise independence of SPN block ciphers
• Sequential indifferentiability of confusion-diffusion networks
• Provable security of HADES structure
• CCA security for contracting (quasi-)Feistel constructions with tight round complexity
• The exact multi-user security of (tweakable) key alternating ciphers with a single permutation
• Indifferentiability of 3-round confusion-diffusion networks
• UFLM: a unified framework for Feistel structure and Lai-Massey structure
• When simple permutations mix poorly. Limited independence does not imply pseudorandomness
• Type-2 generalized Feistel structures based on tweakable block ciphers, reconsidered
• Related-key analysis of generalized Feistel networks with expanding round functions

This page was built for publication: Provable security of (tweakable) block ciphers based on substitution-permutation networks

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