scientific article; zbMATH DE number 697813
From MaRDI portal
Publication:4314029
zbMath0808.94024MaRDI QIDQ4314029
Publication date: 30 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Noisy Simon period finding, The key-dependent message security of key-alternating Feistel ciphers, Optimum attack on 3-round Feistel-2 structure, On the resilience of Even-Mansour to invariant permutations, Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour, Counting active S-boxes is not enough, An analysis of the blockcipher-based hash functions from PGV, Connecting tweakable and multi-key blockcipher security, Towards Understanding the Known-Key Security of Block Ciphers, Keyed sum of permutations: a simpler RP-based PRF, Selective Opening Security from Simulatable Data Encapsulation, What is the effective key length for a block cipher: an attack on every practical block cipher, From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications, Randomized half-ideal cipher on groups with applications to UC (a)PAKE, Simpira v2: A Family of Efficient Permutations Using the AES Round Function, How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers, A modular approach to the security analysis of two-permutation constructions, Quantum attacks against BBB secure PRFs or MACs built from public random permutations, Batching base oblivious transfers, Provably secure reflection ciphers, Output masking of tweakable Even-Mansour can be eliminated for message authentication code, Twin column parity mixers and Gaston. A new mixing layer and permutation, Beyond birthday bound secure fresh rekeying: application to authenticated encryption, AKF: a key alternating Feistel scheme for lightweight cipher designs, Tweaking key-alternating Feistel block ciphers, Rotational cryptanalysis on MAC algorithm chaskey, Quantum attacks on sum of Even-Mansour pseudorandom functions, Key alternating ciphers based on involutions, Reflection ciphers, On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks, Collision Resistant Double-Length Hashing, The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs, Slidex attacks on the Even-Mansour encryption scheme, Reflection cryptanalysis of PRINCE-like ciphers, Security/Efficiency Tradeoffs for Permutation-Based Hashing, Key-Recovery Attacks Against the MAC Algorithm Chaskey, The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of abelian groups, Linicrypt: A Model for Practical Cryptography, Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security, XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees, A Domain Extender for the Ideal Cipher, Orthomorphisms of abelian groups with minimum possible pairwise distances
