Indifferentiability of the Sum of Random Permutations Toward Optimal Security

DOI10.1109/TIT.2017.2679757zbMath1369.94512OpenAlexW2591903672MaRDI QIDQ5352613

Jooyoung Lee

Publication date: 8 September 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2679757

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (6)

Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Block-cipher-based tree hashing ⋮ Security of truncated permutation without initial value ⋮ Multi-user security of the sum of truncated random permutations ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff

This page was built for publication: Indifferentiability of the Sum of Random Permutations Toward Optimal Security