Pages that link to "Item:Q1747661"

The following pages link to How many queries are needed to distinguish a truncated random permutation from a random function? (Q1747661):

Displaying 8 items.

• Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
• Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
• Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds (Q1648810) (← links)
• A note on the chi-square method: a tool for proving cryptographic security (Q1749799) (← links)
• Analysis of the single-permutation encrypted Davies-Meyer construction (Q1801088) (← links)
• The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
• The advantage of truncated permutations (Q2656968) (← links)
• Improved security analysis for nonce-based enhanced hash-then-mask MACs (Q2692363) (← links)