Indifferentiability of 3-round confusion-diffusion networks

DOI10.1007/978-3-031-71073-5_7MaRDI QIDQ6660547zbMATH OpenFDO

Authors Ritam Bhaumik, Mridul Nandi, Sayantan Paul, Abishanka Saha

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71073-5_7

zbMATH Keywords

block cipherdistinguishing advantageindifferentiabilitypermutationsequential indifferentiabilitysubstitution-permutation networks

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Sequential indifferentiability of confusion-diffusion networks
• Indifferentiability of the confusion-diffusion network and the cascade block cipher
• Indifferentiability of confusion-diffusion networks
• Towards provable security of substitution-permutation encryption networks
• Provable security of (tweakable) block ciphers based on substitution-permutation networks

Cites work

• 10-round Feistel is indifferentiable from an ideal cipher
• A domain extender for the ideal cipher
• A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
• A proposal for a new block encryption standard
• Camellia: a 128-bit block cipher and suitable for multiple platforms -- design and analysis.
• Communication Theory of Secrecy Systems*
• Fast Software Encryption Functions
• Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
• Indifferentiability of 8-Round Feistel Networks
• Indifferentiability of confusion-diffusion networks
• Indifferentiability of the confusion-diffusion network and the cascade block cipher
• Layout graphs, random walks and the t-wise independence of SPN block ciphers
• On generalized Feistel networks
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• On the Lai-Massey scheme
• On the pseudorandomness of the AES finalists -- RC6 and Serpent
• PRESENT: An Ultra-Lightweight Block Cipher
• Provable security of (tweakable) block ciphers based on substitution-permutation networks
• Proving the Security of AES Substitution-Permutation Network
• Revisiting the IDEA Philosophy
• Revisiting the indifferentiability of the sum of permutations
• Selected Areas in Cryptography
• Sequential indifferentiability of confusion-diffusion networks
• Serpent: a new block cipher proposal
• Substitution-permutation networks, pseudorandom functions, and natural proofs
• The equivalence of the random oracle model and the ideal cipher model, revisited
• The MacGuffin block cipher algorithm
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• The “Coefficients H” Technique
• Theory of Cryptography
• Tight security bounds for key-alternating ciphers

Cited in

(1)

• Indifferentiability of the confusion-diffusion network and the cascade block cipher

This page was built for publication: Indifferentiability of 3-round confusion-diffusion networks

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