Consider a variation of AES with modified Key-Schedule and following observation on the Key Schedule.
If there exist a relation d between two Master keys, the key schedule is so weak that all sub-keys generated from the master keys have a relation d
Then how this aspect of a cipher can be exploited in following scenarios?
- Distinguish Ciphertext from Random Text
- Partial Key Recovery
- Full Key Recovery
Any guideline or reference to papers explaining basics of such attack is appreciated.