Provable security of (tweakable) block ciphers based on substitution-permutation networks
From MaRDI portal
Publication:1673418
DOI10.1007/978-3-319-96884-1_24zbMath1444.94055OpenAlexW2884060558MaRDI QIDQ1673418
Jooyoung Lee, Zhe Zhang, Aishwarya Thiruvengadam, Benoît Cogliati, Yevgeniy Dodis, John P. Steinberger, Jonathan N. Katz
Publication date: 12 September 2018
Full work available at URL: http://orbilu.uni.lu/handle/10993/42328
tweakable block cipherssubstitution-permutation networksbeyond-birthday-bound securitydomain extension of block ciphers
Related Items (10)
Related-key analysis of generalized Feistel networks with expanding round functions ⋮ Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol ⋮ The \(t\)-wise independence of substitution-permutation networks ⋮ Beyond-birthday security for permutation-based Feistel networks ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Sequential indifferentiability of confusion-diffusion networks ⋮ Provable security of HADES structure ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Pseudorandom Functions: Three Decades Later ⋮ On a generalization of substitution-permutation networks: the HADES design strategy
This page was built for publication: Provable security of (tweakable) block ciphers based on substitution-permutation networks
