User talk:87.69.235.248
Appearance
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 Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle L_{i+1]}, R_{i+1}}
. 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 Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle L_{n+1]}, R_{n+1}}
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)
- 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 Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle L_{i+1]}, R_{i+1}}
. 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 Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle L_{n+1]}, R_{n+1}}
and not . Thus your diagram is incorrect. 81.62.73.125 (talk) 18:41, 12 September 2011 (UTC)
This is the discussion page for an IP user, identified by the user's IP address. Many IP addresses change periodically, and are often shared by several users. If you are an IP user, you may create an account or log in to avoid future confusion with other IP users. Registering also hides your IP address. |