Building a BBB pseudorandom permutation using Lai-Massey networks
From MaRDI portal
Cites work
- About Feistel schemes with six (or more) rounds
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Decorrelation: a theory for block cipher security
- Foiling birthday attacks in length-doubling transformations
- Generic Attacks on Feistel Networks with Internal Permutations
- Generic attacks on the Lai-Massey scheme
- Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 176558 (Why is no real title available?)
- scientific article; zbMATH DE number 177050 (Why is no real title available?)
- scientific article; zbMATH DE number 1149170 (Why is no real title available?)
- scientific article; zbMATH DE number 2081068 (Why is no real title available?)
- scientific article; zbMATH DE number 1504535 (Why is no real title available?)
- Improved All-Subkeys Recovery Attacks on FOX, KATAN and SHACAL-2 Block Ciphers
- Improved generic attacks on unbalanced Feistel schemes with expanding functions
- Information Security and Cryptology - ICISC 2005
- On generalized Feistel networks
- On Lai-Massey and quasi-Feistel ciphers
- Post-quantum security on the Lai-Massey scheme
- Progress in Cryptology - INDOCRYPT 2003
- Pseudorandomness analysis of the (extended) Lai-Massey scheme
- Quantum attacks on Lai-Massey structure
- Revisiting the IDEA Philosophy
- Selected Areas in Cryptography
- The “Coefficients H” Technique
This page was built for publication: Building a BBB pseudorandom permutation using Lai-Massey networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326437)
