How to protect DES against exhaustive key search (an analysis of DESX).
From MaRDI portal
Publication:5927707
DOI10.1007/s001450010015zbMath1068.94531OpenAlexW2085797166MaRDI QIDQ5927707
Publication date: 2001
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001450010015
Related Items
How to build an ideal cipher: the indifferentiability of the Feistel construction, Beyond quadratic speedups in quantum attacks on symmetric schemes, CryptHOL: game-based proofs in higher-order logic, An analysis of the blockcipher-based hash functions from PGV, Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256, Security Analysis of PRINCE, Selective Opening Security from Simulatable Data Encapsulation, Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more, Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls, On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers, Post-quantum security on the Lai-Massey scheme, Salvaging Weak Security Bounds for Blockcipher-Based Constructions, Quantum attacks against BBB secure PRFs or MACs built from public random permutations, Provably secure reflection ciphers, Impossible differential cryptanalysis on reduced-round PRINCEcore, Secure integration of asymmetric and symmetric encryption schemes, Quantum key-length extension, Tweakable block ciphers, Quantum attacks on sum of Even-Mansour pseudorandom functions, Reflection ciphers, Minimizing the two-round Even-Mansour cipher, Notions and relations for RKA-secure permutation and function families, The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs, Slidex attacks on the Even-Mansour encryption scheme, The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3, A Domain Extender for the Ideal Cipher, Attacks on beyond-birthday-bound MACs in the quantum setting
