Linking Stam's bounds with generalized truncation

DOI10.1007/978-3-030-12612-4_16OpenAlexW2912290001MaRDI QIDQ2290458FDOQ2290458

Authors: Bart Mennink 

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-12612-4_16

Recommendations

• The summation-truncation hybrid: reusing discarded bits for free
• The advantage of truncated permutations
• Indifferentiability of truncated random permutations
• How many queries are needed to distinguish a truncated random permutation from a random function?
• The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC

zbMATH Keywords

Kullback-Leibler divergencePRP-to-PRF designsStam's bounds

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• Luby-Rackoff backwards with more users and more security
• A note on the chi-square method: a tool for proving cryptographic security
• How many queries are needed to distinguish a truncated random permutation from a random function?
• Leakage resilient value comparison with application to message authentication
• The summation-truncation hybrid: reusing discarded bits for free
• Multi-user security of the sum of truncated random permutations
• Security of truncated permutation without initial value

This page was built for publication: Linking Stam's bounds with generalized truncation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290458)