New Attacks on Feistel Structures with Improved Memory Complexities
type: Item
instance of: scholarly article
title: New Attacks on Feistel Structures with Improved Memory Complexities
zbMATH Open document ID: 1375.94120
DOI: 10.1007/978-3-662-47989-6_21
author: Itai Dinur
author: Orr Dunkelman
author: Nathan Keller
author: Adi Shamir
published in: Lecture Notes in Computer Science
publication date: 2015-12-10T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6519434
zbMATH Keywords: cryptanalysis
zbMATH Keywords: block cipher
zbMATH Keywords: Feistel structure
zbMATH Keywords: dissection
zbMATH Keywords: meet-in-the-middle
zbMATH Keywords: splice-and-cut
zbMATH Keywords: CAST-128
zbMATH Keywords: DEAL
describes a project that uses: FOX
describes a project that uses: KTANTAN
MaRDI profile type: Publication
full work available at URL: 978-3-662-47989-6 21
OpenAlex ID: W2287397056
cites work: Preimage Attacks on One-Block MD4, 63-Step MD5 and More
cites work: Biclique Cryptanalysis of the Full AES
cites work: A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
cites work: Sieve-in-the-Middle: Improved MITM Attacks
cites work: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
cites work: Generic Key Recovery Attack on Feistel Scheme
cites work: Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 Family
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Finding Preimages of Tiger Up to 23 Steps
description: scientific article