The following pages link to (Q3374930):
Displaying 17 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)
- 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)
- 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)
- Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks (Q2794524) (← links)
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers (Q2835582) (← links)
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC (Q2835585) (← links)
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal (Q3104710) (← links)
- Random number generators based on permutations can pass the collision test (Q3383141) (← links)
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier (Q3525682) (← links)
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound (Q5452269) (← links)
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (Q5502805) (← links)
