The t-wise Independence of Substitution-Permutation Networks
Authors:
- Tianren LiuTLTianren Liu
- Vinod VaikuntanathanVVVinod Vaikuntanathan
- 11 August 2021
- book chapter
- Published by Springer Nature
- p. 454-483
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- An application of the O’Nan-Scott theorem to the group generated by the round functions of an AES-like cipherDesigns, Codes and Cryptography, 2009
- Simple permutations mix even betterRandom Structures & Algorithms, 2007
- Exact maximum expected differential and linear probability for two-round Advanced Encryption StandardIET Information Security, 2007
- Simple permutations mix wellTheoretical Computer Science, 2005
- The interpolation attack on block ciphers1997
- Provable security against a differential attackJournal of Cryptology, 1995
- A weak cipher that generates the symmetric groupJournal of Cryptology, 1994
- Differential cryptanalysis of DES-like cryptosystemsJournal of Cryptology, 1991
- Is the Data Encryption Standard a group? (Results of cycling experiments on DES)Journal of Cryptology, 1988
- Generators for Certain Alternating Groups with Applications to CryptographySIAM Journal on Applied Mathematics, 1975