We initiate the provable related-key security treatment for models of practical Feistel ciphers. In detail, we consider Feistel networks with four whitening keys wi(k), i = 0; 1; 2; 3,and round-functions of the form f(j(k) X), where k is the master-key, wi and j are efficient transformations, and f is a public ideal function or permutation accessible by the adversary.We investigate key-schedule conditions that are sufficient for security against XOR-induced related-key attacks up to 2n=2 adversarial queries. When the key-schedules are non-linear, we prove security for 4 rounds. When only affine key-schedules are used, we prove security for 6 rounds. These also imply securet weakable Feistel ciphers in the Random Oracle model.By shuffling the key-schedules, our model unifies both theDES-like structure (known as Feistel-2 scheme in the cryptanalytic community, a.k.a. key-alternating Feistel due to Lampe and Seurin, FSE 2014) and the Lucifer-like model (previouslyanalyzed by Guo and Lin, TCC 2015). This allows us to deriveconcrete implications on these two (more common) models, and helps understanding their related-key security difference.
To View the Base Paper Abstract Contents
Now it is Your Time to Shine.
Great careers Start Here.
We Guide you to Every Step
Success! You're Awesome
Thank you for filling out your information!
We’ve sent you an email with your Final Year Project PPT file download link at the email address you provided. Please enjoy, and let us know if there’s anything else we can help you with.
To know more details Call 900 31 31 555
The WISEN Team