On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
From MaRDI portal
Publication:2795968
DOI10.1007/978-3-662-48800-3_5zbMath1375.94153OpenAlexW2295049369MaRDI QIDQ2795968
Publication date: 23 March 2016
Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48800-3_5
block cipherCMCLuby-Rackoffpseudorandom permutation (PRP)strong pseudorandom permutation (SPRP)XLS (eXtended Latin Square)
Related Items
Related-key analysis of generalized Feistel networks with expanding round functions ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers ⋮ On the optimality of non-linear computations for symmetric key primitives ⋮ Provable related-key security of contracting Feistel networks
This page was built for publication: On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
