How to Protect DES Against Exhaustive Key Search
From MaRDI portal
Recommendations
- How to protect DES against exhaustive key search (an analysis of DESX).
- scientific article; zbMATH DE number 1759790
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle
- scientific article; zbMATH DE number 2216934
- An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks
- Search for Related-Key Differential Characteristics in DES-Like Ciphers
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
- On the Security of 2-Key Triple DES
- Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
- Protecting triple-DES against DPA. A practical application of domain-oriented masking
Cited in
(24)- Hidden shift quantum cryptanalysis and implications
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
- Reflection cryptanalysis of PRINCE-like ciphers
- Quantum key-length extension
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Side-channel analysis protection and low-latency in action -- case study of PRINCE and Midori
- Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
- Improved Related-key Attacks on DESX and DESX+
- Building Secure Block Ciphers on Generic Attacks Assumptions
- scientific article; zbMATH DE number 1024498 (Why is no real title available?)
- Attacking triple encryption
- Collision resistant double-length hashing
- Pseudorandom functions: three decades later
- How to protect DES against exhaustive key search (an analysis of DESX).
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Post-quantum security on the Lai-Massey scheme
- Provably secure reflection ciphers
- Quantum attacks on Lai-Massey structure
- Integral resistance of block ciphers with key whitening by modular addition
- New quantum attacks on some Feistel variants
This page was built for publication: How to Protect DES Against Exhaustive Key Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452356)
