Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
From MaRDI portal
Publication:3525688
DOI10.1007/978-3-540-71039-4_24zbMath1154.94385OpenAlexW1732514021WikidataQ58765274 ScholiaQ58765274MaRDI QIDQ3525688
Jean-Jacques Quisquater, Baydoin Collard, François-Xavier Standaert
Publication date: 18 September 2008
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71039-4_24
Related Items (6)
Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ Optimising linear key recovery attacks with affine Walsh transform pruning ⋮ Multidimensional linear cryptanalysis ⋮ Improving key-recovery in linear attacks: application to 28-round PRESENT ⋮ The Cryptanalysis of Reduced-Round SMS4 ⋮ A Differential-Linear Attack on 12-Round Serpent
Cites Work
- The Independence of Linear Approximations in Symmetric Cryptanalysis
- The Wide Trail Design Strategy
- Serpent: A New Block Cipher Proposal
- Advances in Cryptology – CRYPTO 2004
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent