Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Summary list for section 5.1, description of block ciphers #82

Open
joedoyle opened this issue Mar 21, 2014 · 3 comments
Open

Summary list for section 5.1, description of block ciphers #82

joedoyle opened this issue Mar 21, 2014 · 3 comments

Comments

@joedoyle
Copy link

First, thanks for writing this. I'm smack in the middle of your target audience, an everyday programmer without much knowledge of cryptography, and reading the first few sections has proved enlightening.

The last sentence in section 5.1 includes "as long as it doesn’t sacrifice any of the above properties". When I read that, "which properties?" came into mind, so maybe it'd be useful to explicitly summarize which properties you're referring to. I picked out two, 1) that a different key must lead to a completely different set of arrows, and 2) knowing many (input,output) pairs shouldn't give any information about any other (input, output) pair.

@lvh
Copy link
Member

lvh commented Mar 21, 2014

Thanks! Glad to hear you're enjoying the book.

That sentence is definitely a total cop-out and should be addressed :) There is another big review ticket open (#80) that suggests some changes, but it also suggests many other things. I'm trying to get that one broken up and that section cleaned up, and then we can clarify that sentence without introducing inconsistencies.

Thanks again!

@lvh lvh changed the title summary list for section 5.1, description of block ciphers Summary list for section 5.1, description of block ciphers Mar 21, 2014
@joedoyle
Copy link
Author

Regarding #80, for what little my opinion is worth, I think your point about only a tiny fraction of all permutations being used is important. It's useful to first think about how many possible relations there could be between P and C, but then further realize that a given key can only select one of them, and so the number of permutations that could be used is limited to the number of possible keys.

@lvh
Copy link
Member

lvh commented Mar 21, 2014

I think your opinion is very valuable, and yes, I agree. He has a point in that it is not sufficient, though :)

@lvh lvh added this to the Public alpha 2 (v0.2.0) milestone Mar 27, 2014
@lvh lvh removed this from the Public alpha 2 (v0.2.0) milestone Dec 4, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants