Generic Attacks on Feistel Networks with Internal Permutations
From MaRDI portal
Publication:3637131
DOI10.1007/978-3-642-02384-2_4zbMath1246.94039MaRDI QIDQ3637131
Publication date: 7 July 2009
Published in: Progress in Cryptology – AFRICACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02384-2_4
94A60: Cryptography
Related Items
Generic attacks on the Lai-Massey scheme, Generic attacks with standard deviation analysis on a-Feistel schemes, Square reflection cryptanalysis of 5-round Feistel networks with permutations, Applications of Simon's algorithm in quantum attacks on Feistel variants, Building Secure Block Ciphers on Generic Attacks Assumptions, The “Coefficients H” Technique
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On weaknesses of non-surjective round functions
- The security of Feistel ciphers with six rounds or less
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Foiling Birthday Attacks in Length-Doubling Transformations
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Unbalanced Feistel networks and block cipher design
- Cryptanalysis of Ladder-DES
- Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions