Pages that link to "Item:Q5502805"
From MaRDI portal
The following pages link to A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (Q5502805):
Displaying 27 items.
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds (Q1648810) (← links)
- Mirror theory and cryptography (Q1675488) (← 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)
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model (Q1801090) (← links)
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 (Q2055608) (← links)
- The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
- Low-memory attacks against two-round Even-Mansour using the 3-XOR problem (Q2304983) (← links)
- Beyond-birthday secure domain-preserving PRFs from a single permutation (Q2416937) (← links)
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption (Q2692358) (← links)
- How to build optimally secure PRFs using block ciphers (Q2692365) (← links)
- On the XOR of Multiple Random Permutations (Q2794522) (← links)
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers (Q2835582) (← links)
- XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees (Q2835583) (← links)
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC (Q2835585) (← links)
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$ (Q2946874) (← links)
- How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers (Q2958133) (← links)
- Random number generators based on permutations can pass the collision test (Q3383141) (← links)
- The “Coefficients H” Technique (Q3644210) (← links)
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (Q5502805) (← links)
- (Q6084345) (← links)
- Multi-user security of the sum of truncated random permutations (Q6132432) (← links)
- Luby-Rackoff backwards with more users and more security (Q6157554) (← links)
- The Relation Between CENC and NEMO (Q6162314) (← links)
- \textsf{LightMAC}: fork it and make it faster (Q6584328) (← links)
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis (Q6636384) (← links)
