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?

  1. Distinguish Ciphertext from Random Text
  2. Partial Key Recovery
  3. Full Key Recovery

Any guideline or reference to papers explaining basics of such attack is appreciated.

  • $\begingroup$ it looks like homework / excercise meta.stackoverflow.com/questions/334822/…. Try to explain what have you tried and achieved until now and what exaxtly is the problem $\endgroup$ – gusto2 Aug 22 '17 at 7:40
  • $\begingroup$ @gusto2 actually : crypto.meta.stackexchange.com/questions/90/… and crypto.meta.stackexchange.com/questions/626/… (let's not involve S.O. here :p ) $\endgroup$ – Biv Aug 22 '17 at 7:59
  • 1
    $\begingroup$ :) wel its not homework assignment, and i dont want the solution i would like to do it myself. But some basic guidelines, reference to the some basic papers(not much advance which breaks some diffiuclt cipher, rather papers which may try to show related key attack in scenario of some dummy cipher) will be helpful $\endgroup$ – khan Aug 22 '17 at 8:13
  • $\begingroup$ any help or papers references $\endgroup$ – khan Aug 26 '17 at 17:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.