New attacks on Feistel structures with improved memory complexities

DOI10.1007/S00145-026-09571-YMaRDI QIDQ6847548zbMATH OpenFDO

Authors Itai Dinur, Orr Dunkelman, Nathan Keller, David A. Ross, Adi Shamir

Publication date 9 March 2026

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00145-026-09571-Y

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 3952651 (Why is no real title available?)
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• Advances in cryptology -- ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7--11, 2014. Proceedings, Part I
• Attacking triple encryption
• Attacks only get better: how to break FF3 on large domains
• Biclique Cryptanalysis of the Full AES
• Bicliques for preimages: attacks on Skein-512 and the SHA-2 family
• Breaking the FF3 format-preserving encryption standard over small domains
• Cryptanalysis of Feistel networks with secret round functions
• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
• Efficient dissection of bicomposite problems with cryptanalytic applications
• Generic key recovery attack on Feistel scheme
• Generic round-function-recovery attacks for Feistel networks over small domains
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Improved All-Subkeys Recovery Attacks on FOX, KATAN and SHACAL-2 Block Ciphers
• Meet-in-the-middle attacks on generic Feistel constructions
• Memory-Efficient Algorithms for Finding Needles in Haystacks
• New attacks on Feistel structures with improved memory complexities
• Parallel collision search with cryptanalytic applications
• Preimage Attacks on One-Block MD4, 63-Step MD5 and More
• Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
• Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
• Quantum chosen-ciphertext attacks against Feistel ciphers
• Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
• Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, Lblock and Simon
• Selected Areas in Cryptography
• Sieve-in-the-middle: improved MITM attacks
• Three third generation attacks on the format preserving encryption scheme FF3

This page was built for publication: New attacks on Feistel structures with improved memory complexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847548)