New Attacks on Feistel Structures with Improved Memory Complexities

DOI10.1007/978-3-662-47989-6_21zbMath1375.94120OpenAlexW2287397056MaRDI QIDQ3457122

Orr Dunkelman, Nathan Keller, Adi Shamir, Itai Dinur

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_21

zbMATH Keywords

block ciphercryptanalysismeet-in-the-middledissectionFeistel structuresplice-and-cutDEALCAST-128

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Optimum attack on 3-round Feistel-2 structure ⋮ Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ Algebraic Insights into the Secret Feistel Network ⋮ Efficient dissection of bicomposite problems with cryptanalytic applications ⋮ Cryptanalysis of Feistel Networks with Secret Round Functions

Uses Software

• FOX
• KTANTAN

Cites Work

• Sieve-in-the-Middle: Improved MITM Attacks
• Generic Key Recovery Attack on Feistel Scheme
• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• Biclique Cryptanalysis of the Full AES
• Finding Preimages of Tiger Up to 23 Steps
• Preimage Attacks on One-Block MD4, 63-Step MD5 and More
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 Family

This page was built for publication: New Attacks on Feistel Structures with Improved Memory Complexities