User talk:87.69.235.248: Difference between revisions
Appearance
Content deleted Content added
Line 11: | Line 11: | ||
:::changing again to [[:File:Feistel cipher diagram.png]] is stupid 19:00, 12 September 2011 (UTC) |
:::changing again to [[:File:Feistel cipher diagram.png]] is stupid 19:00, 12 September 2011 (UTC) |
||
::::Once again, the result in the diagram should be <math>L_{n+1}, R_{n+1}</math> and not <math>L_{n}, R_{n}</math>. Make a concrete example and see for yourself. So please fix this mistake. And please abstain from calling me stupid. [[Special:Contributions/81.62.73.125|81.62.73.125]] ([[User talk:81.62.73.125|talk]]) 19:07, 12 September 2011 (UTC) |
::::Once again, the result in the diagram should be <math>L_{n+1}, R_{n+1}</math> and not <math>L_{n}, R_{n}</math>. Make a concrete example and see for yourself. So please fix this mistake. And please abstain from calling me stupid. [[Special:Contributions/81.62.73.125|81.62.73.125]] ([[User talk:81.62.73.125|talk]]) 19:07, 12 September 2011 (UTC) |
||
:::::sorry. I didn't mean that you are stupud |
:::::sorry. I didn't mean that you are stupud. I didn't understand the problem until now, so i thout your acion is stupid. my english is very bad, so I gess "stupid" was the wrong word to use. sorry again. [[Special:Contributions/87.69.235.248|87.69.235.248]] ([[User talk:87.69.235.248#top|talk]]) 19:14, 12 September 2011 (UTC) |
Revision as of 19:15, 12 September 2011
Your digaram of a Feistel cipher
I reverted your edit, because your diagram is wrong. Either you describe a cipher with n rounds. Then the round keys have indices from 0 to n-1. and the ciphertext blocks have indices n. In this case the text needs to be changed too. Or you describe a Feistel cipher with n+1 rounds. Then the round keys should have indices running from 0 through n and the ciphertext blocks have indices n+1. 81.62.73.125 (talk) 17:03, 12 September 2011 (UTC)
- File:Feistel cipher diagram.png also have n+1 rounds + the text says: , which mean n+1 rounds. 87.69.235.248 (talk) 17:43, 12 September 2011 (UTC)
- OK, let's try this with an example. Assume n=4. Hence there are 5 rounds, which have five round keys: . The first round takes as input uses the key and computes . The next round takes as input uses the key and computes . Going further, the third round takes as input uses the key and computes . You should see a pattern here: each round takes input as input uses the key and computes . I.e. the index of the result is always by 1 larger than the input and the index of the round key. I.e. for n=5, the last round key is and the output is . More generally if the last round function is then the result should be and not . Thus your diagram is incorrect. 81.62.73.125 (talk) 18:41, 12 September 2011 (UTC)
- my file and File:Feistel cipher diagram.png are the same/ so you have two choices:
- remove the PNG picture
- change the text of the article
- changing again to File:Feistel cipher diagram.png is stupid 19:00, 12 September 2011 (UTC)
- Once again, the result in the diagram should be and not . Make a concrete example and see for yourself. So please fix this mistake. And please abstain from calling me stupid. 81.62.73.125 (talk) 19:07, 12 September 2011 (UTC)
- sorry. I didn't mean that you are stupud. I didn't understand the problem until now, so i thout your acion is stupid. my english is very bad, so I gess "stupid" was the wrong word to use. sorry again. 87.69.235.248 (talk) 19:14, 12 September 2011 (UTC)
- Once again, the result in the diagram should be and not . Make a concrete example and see for yourself. So please fix this mistake. And please abstain from calling me stupid. 81.62.73.125 (talk) 19:07, 12 September 2011 (UTC)
- my file and File:Feistel cipher diagram.png are the same/ so you have two choices:
- OK, let's try this with an example. Assume n=4. Hence there are 5 rounds, which have five round keys: . The first round takes as input uses the key and computes . The next round takes as input uses the key and computes . Going further, the third round takes as input uses the key and computes . You should see a pattern here: each round takes input as input uses the key and computes . I.e. the index of the result is always by 1 larger than the input and the index of the round key. I.e. for n=5, the last round key is and the output is . More generally if the last round function is then the result should be and not . Thus your diagram is incorrect. 81.62.73.125 (talk) 18:41, 12 September 2011 (UTC)