# The Advantage of Truncated Permutations

@article{Gilboa2019TheAO,
author={Shoni Gilboa and Shay Gueron},
journal={ArXiv},
year={2019},
volume={abs/1610.02518}
}
• Published 2019
• Mathematics, Computer Science
• ArXiv
• Constructing a Pseudo Random Function (PRF) from a pseudorandom permutation is a fundamental problem in cryptology. Such a construction, implemented by truncating the last m bits of permutations of $$\{0, 1\}^{n}$$ was suggested by Hall et al. (1998). They conjectured that the distinguishing advantage of an adversary with q quesires, $$\mathbf{Adv}_{n, m} (q)$$, is small if $$q = o (2^{(m+n)/2})$$, established an upper bound on $$\mathbf{Adv}_{n, m} (q)$$ that confirms the conjecture for \(m… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES
Building PRFs from PRPs
• Computer Science
• 1998
• 78
• PDF
A tool for obtaining tighter security analyses of pseudo - random function based constructions , with applications to PRP to PRF conversion ” , ePrint 1999 / 024
• 1998
Building prfs from prps, in: Proceedings of CRYPTO-98: Advances in Cryptography
• 1998