10-Round Feistel is Indifferentiable from an Ideal Cipher

DOI10.1007/978-3-662-49896-5_23zbMath1351.94039OpenAlexW2429736030WikidataQ56270823 ScholiaQ56270823MaRDI QIDQ5739218

Dana Dachman-Soled, Aishwarya Thiruvengadam, Jonathan N. Katz

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_23

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ Asymmetric PAKE with low computation \textit{and} communication ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Public-Seed Pseudorandom Permutations ⋮ Indifferentiability of 8-Round Feistel Networks

This page was built for publication: 10-Round Feistel is Indifferentiable from an Ideal Cipher