scientific article
From MaRDI portal
Publication:3374930
zbMath1082.94526MaRDI QIDQ3374930
Publication date: 1 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Multi-user security of the sum of truncated random permutations ⋮ Improved multi-user security using the squared-ratio method ⋮ Luby-Rackoff backwards with more users and more security ⋮ The Relation Between CENC and NEMO ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ How to build optimally secure PRFs using block ciphers ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ On the XOR of Multiple Random Permutations ⋮ Robust Pseudo-Random Number Generators with Input Secure Against Side-Channel Attacks ⋮ A Generic Method to Design Modes of Operation Beyond the Birthday Bound ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Random number generators based on permutations can pass the collision test ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ A Proof of Security in O(2 n ) for the Xor of Two Random Permutations ⋮ The summation-truncation hybrid: reusing discarded bits for free
This page was built for publication:
