Generic Attacks on Feistel Networks with Internal Permutations

DOI10.1007/978-3-642-02384-2_4zbMath1246.94039OpenAlexW1552032016MaRDI QIDQ3637131

Jacques Patarin, Joana Treger

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Applications of Simon's algorithm in quantum attacks on Feistel variants ⋮ Square reflection cryptanalysis of 5-round Feistel networks with permutations ⋮ Generic attacks with standard deviation analysis on a-Feistel schemes ⋮ Generic attacks on the Lai-Massey scheme ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions ⋮ The “Coefficients H” Technique

Uses Software

• Camellia

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

This page was built for publication: Generic Attacks on Feistel Networks with Internal Permutations