Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
From MaRDI portal
Recommendations
- An algebraic attack on the improved summation generator with 2-bit memory
- Generic attacks for the Xor of \(k\) random permutations
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- Advances in Cryptology - CRYPTO 2003
- Low memory attacks on small key CSIDH
- New attacks on Feistel structures with improved memory complexities
- An NP decision procedure for protocol insecurity with XOR
- Algebraic Attacks on Combiners with Memory and Several Outputs
- Toward better depth lower bounds: the XOR-KRW conjecture
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
Cited in
(9)- Limitations of the Even-Mansour construction
- Provably secure reflection ciphers
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2
- Security analysis of Even-Mansour structure hash functions
- \(k\)-SUM in the sparse regime: complexity and applications
- Slidex attacks on the Even-Mansour encryption scheme
- New key recovery attacks on minimal two-round Even-Mansour ciphers
- Minimalism in cryptography: the Even-Mansour scheme revisited
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
This page was built for publication: Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304983)
