Cryptanalysis of Feistel networks with secret round functions
From MaRDI portal
Publication:2807198
DOI10.1007/978-3-319-31301-6_6zbMATH Open1396.94060OpenAlexW2395664524MaRDI QIDQ2807198FDOQ2807198
Authors: Alex Biryukov, Gaëtan Leurent, Léo Perrin
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_6
Recommendations
Cites Work
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Powers of tensors and fast matrix multiplication
- Title not available (Why is that?)
- Block ciphers that are easier to mask: how far can we go?
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Security analysis of key-alternating Feistel ciphers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The block cipher \textsc{Square}
- Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- Cryptanalysis of Feistel networks with secret round functions
- Analysis of involutional ciphers: Khazad and Anubis.
- New attacks on Feistel structures with improved memory complexities
- Title not available (Why is that?)
Cited In (17)
- Title not available (Why is that?)
- Square reflection cryptanalysis of 5-round Feistel networks with permutations
- Yoyo attack on 4-round Lai-Massey scheme with secret round functions
- The retracing boomerang attack, with application to reduced-round AES
- Boomerang uniformity of popular S-box constructions
- Generic round-function-recovery attacks for Feistel networks over small domains
- Upper Bounds for the Security of Several Feistel Networks
- Cryptanalysis of Feistel networks with secret round functions
- The retracing boomerang attack
- Some group-theoretical results on Feistel networks in a long-key scenario
- Three third generation attacks on the format preserving encryption scheme FF3
- Multiset structural attack on generalized Feistel networks
- Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
- Meet-in-the-middle attacks on generic Feistel constructions
- Algebraic insights into the secret Feistel network
- On the use of conjugacy of substitutions in determining the key in Feistel networks
- Advances in Cryptology – CRYPTO 2004
Uses Software
This page was built for publication: Cryptanalysis of Feistel networks with secret round functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807198)