Differential Cryptanalysis of Feal and N-Hash
From MaRDI portal
Publication:4037445
DOI10.1007/3-540-46416-6_1zbMATH Open0777.94012OpenAlexW1576495995WikidataQ27980206 ScholiaQ27980206MaRDI QIDQ4037445FDOQ4037445
Authors: Eli Biham, Adi Shamir
Publication date: 18 May 1993
Published in: Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-46416-6_1
Recommendations
differential cryptanalysischosen-plaintext attack\(N\)-Hash functionFeal family of encryption algorithmssecret-key ciphers
Cited In (17)
- Computing AES related-key differential characteristics with constraint programming
- Revisiting AES related-key differential attacks with constraint programming
- And Rijndael? Automatic related-key differential analysis of Rijndael
- Title not available (Why is that?)
- Differential Properties of the HFE Cryptosystem
- Distributed differential criptanalysis of FEAL-8
- Differential cryptanalysis of Lucifer
- A generic algorithm for efficient key recovery in differential attacks -- and its associated tool
- Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
- Substitution-permutation networks resistant to differential and linear cryptanalysis
- The cryptanalysis of FEAL-4 with 20 chosen plaintexts
- On properties of translation groups in the affine general linear group with applications to cryptography
- Best differential characteristic search of FEAL
- One-way hash functions with changeable parameters.
- On CCZ-equivalence of addition mod \(2^n\)
- Linear and differential cryptanalysis of Russian GOST
- Title not available (Why is that?)
This page was built for publication: Differential Cryptanalysis of Feal and N-Hash
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037445)