Pages that link to "Item:Q5385518"
From MaRDI portal
The following pages link to Improving the Time Complexity of Matsui’s Linear Cryptanalysis (Q5385518):
Displaying 14 items.
- Walsh transforms and cryptographic applications in bias computing (Q276565) (← links)
- Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using \(\chi^2\)-method (Q329196) (← links)
- Zero-correlation linear cryptanalysis of reduced-round LBlock (Q398985) (← links)
- Improving key-recovery in linear attacks: application to 28-round PRESENT (Q2055609) (← links)
- New attacks from old distinguishers improved attacks on serpent (Q2152176) (← links)
- How Much Can Complexity of Linear Cryptanalysis Be Reduced? (Q2942831) (← links)
- Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent (Q3525688) (← links)
- A Statistical Saturation Attack against the Block Cipher PRESENT (Q3623045) (← links)
- The Cryptanalysis of Reduced-Round SMS4 (Q3644192) (← links)
- Lombardi Drawings of Knots and Links (Q4625105) (← links)
- Automatic Key Recovery of Feistel Ciphers: Application to SIMON and SIMECK (Q5095926) (← links)
- (Q5150613) (← links)
- Improved differential-linear attacks with applications to ARX ciphers (Q5918561) (← links)
- Improved differential-linear attacks with applications to ARX ciphers (Q5970775) (← links)
