scientific article; zbMATH DE number 1302860

zbMath0931.94045MaRDI QIDQ4249345

Bruce Schneier, John Kelsey, David Wagner, Chris Hall

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

securitypseudo-random permutationspseudo-random functionscipher feedback modewider block cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (22)

Optimal forgeries against polynomial-based MACs and GCM ⋮ The advantage of truncated permutations ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Tight security of cascaded LRW2 ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ 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 ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ How to build optimally secure PRFs using block ciphers ⋮ How many queries are needed to distinguish a truncated random permutation from a random function? ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ On the XOR of Multiple Random Permutations ⋮ A Generic Method to Design Modes of Operation Beyond the Birthday Bound ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ Leakage resilient value comparison with application to message authentication ⋮ 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 ⋮ On the streaming indistinguishability of a random permutation and a random function

This page was built for publication: