On weak key-scheduling algorithms relatively the related-key attack
From MaRDI portal
Recommendations
Cites work
- Distinguisher and Related-Key Attack on the Full AES-256
- Fast Software Encryption
- scientific article; zbMATH DE number 1689015 (Why is no real title available?)
- scientific article; zbMATH DE number 2089313 (Why is no real title available?)
- scientific article; zbMATH DE number 1024009 (Why is no real title available?)
- scientific article; zbMATH DE number 1107691 (Why is no real title available?)
- scientific article; zbMATH DE number 1418257 (Why is no real title available?)
- Improved Slide Attacks
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- New types of cryptanalytic attacks using related keys
- Reflection Cryptanalysis of Some Ciphers
- Related-Key Boomerang and Rectangle Attacks
Cited in
(6)- New types of cryptanalytic attacks using related keys
- A Weak Key Class of XTEA for a Related-Key Rectangle Attack
- A related-key attack on block ciphers with weak recurrent key schedules
- Related-key attack on 5-round Kuznyechik
- Weak-Key Class of MISTY1 for Related-Key Differential Attack
- On the Role of Key Schedules in Attacks on Iterated Ciphers
This page was built for publication: On weak key-scheduling algorithms relatively the related-key attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147370)