Timeline for What's the mathematical model behind the security claims of symmetric ciphers and digest algorithms?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2011 at 2:39 | history | edited | D.W. | CC BY-SA 3.0 |
fix typo (missing word)
|
| Jul 20, 2011 at 9:27 | comment | added | emboss | Thanks! OK, maybe I should read "The design of Rijndael", I heard good things about it. | |
| Jul 20, 2011 at 3:19 | comment | added | D.W. | @emboss I expect they get used because (a) they work, and (b) they can be implemented efficiently in software. For example, XOR and addition can be a cheap (1 cycle) way to mix a lot of bits efficiently. And other operations (e.g., table look-ups, bit operations) are a cheap way to get non-linearity. You need both non-linearity and good mixing to have a secure cryptosystem. Thomas Pornin has some good book recommendations. The original AES submission also had some justification for their design. | |
| Jul 20, 2011 at 0:21 | comment | added | emboss | One of my questions still remains unresolved. I still don't know why XOR, bit shifting and the like are used for hashes and ciphers in the first place - if there is any mathematical reasoning behind this, why it's exactly these operations and nothing else? Do you happen to know where I can find some background material on this? | |
| Jul 20, 2011 at 0:15 | vote | accept | emboss | ||
| Jul 11, 2011 at 21:24 | history | edited | nealmcb | CC BY-SA 3.0 |
hyperlink SAT
|
| Jul 10, 2011 at 2:09 | history | answered | D.W. | CC BY-SA 3.0 |