The Advantage of Truncated Permutations

  title={The Advantage of Truncated Permutations},
  author={Shoni Gilboa and Shay Gueron},
  • Shoni Gilboa, Shay Gueron
  • 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

    Topics from this paper.

    Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
    • 40
    • PDF
    Revisiting Variable Output Length XOR Pseudorandom Function
    • 11
    • PDF
    How to Build Pseudorandom Functions From Public Random Permutations
    • 7
    • PDF
    Better Bounds for Block Cipher Modes of Operation via Nonce-Based Key Derivation
    • 20
    • PDF
    AES-GCM-SIV: Specification and Analysis
    • 23
    • PDF
    Linking Stam's Bounds with Generalized Truncation
    • 3
    • Highly Influenced
    • PDF


    Publications referenced by this paper.
    Distinguishing a truncated random permutation from a random function
    • 10
    • PDF
    Building PRFs from PRPs
    • 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