I am studying for network security exam. And in the slide about Key Management, under a heading Key Verification I see this:
- Almost all cryptographic algorithms have some weak keys that should not be used.
- With the help of key verification procedures, these keys can be regenerated if they occur.
This doesn't make sense to me, how some particular key in algorithm might be weaker then any other key? Does key verification mean something else? And lets just for the moment imagine that some are weaker, then why would they be generated in the first place?