The advantage of truncated permutations

DOI10.1016/j.dam.2021.01.029zbMath1459.94088arXiv1610.02518OpenAlexW2949813050MaRDI QIDQ2656968

Shay Gueron, Shoni Gilboa

Publication date: 17 March 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.02518

zbMATH Keywords

pseudo-random permutationspseudo-random functionscipher feedback modepseudo random function advantage

Mathematics Subject Classification ID

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

Related Items (7)

Cycle structures of orthomorphisms extending partial orthomorphisms of Boolean groups ⋮ Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Quantum attacks on PRFs based on public random permutations ⋮ How many queries are needed to distinguish a truncated random permutation from a random function? ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ Infinite classes of generalised complete permutations

Cites Work

• How many queries are needed to distinguish a truncated random permutation from a random function?
• Distance between sampling with and without replacement
• Unnamed Item

This page was built for publication: The advantage of truncated permutations