Content deleted Content added
→"The Meaning of Hard" section seems out of place: new section |
|||
Line 28:
Seems to imply that the "second category of functions" algorithms necessarily 'mixes the bits or a message', and what does that even mean? Also, "some of these functions are already broken and are no longer in use", could be elaborated on or perhaps have its own subsection in the article.
== "The Meaning of Hard" section seems out of place ==
[[Security_of_cryptographic_hash_functions#The_meaning_of_.22hard.22|"The Meaning of Hard" section]] doesn't seem to fit well in the immediate section it is in. But my primary concern is that it doesn't make a clear distinction between the hash size and the key size used in public key systems.
> However, non-existence of a polynomial time algorithm does not automatically ensure that the system is secure. The difficulty of a problem also depends on its size. For example, RSA public key cryptography relies on the difficulty of integer factorization. However, it is considered secure only with keys that are at least 1024 bits large.
In this case, 1024 bits is the key size of the RSA key, and has nothing to do with the "modified hash" that the RSA algorithm encrypts with the public key. I'm ''assuming'' the length of the hash is relevant to how "hard" it is to bruteforce, but isn't even mentioned. Anyone who reads that section and isn't already familiar with public key cryptography is going to misunderstand the information; I can't tell if the section needs a rewrite, or if it should be removed entirely.
[[User:IQAndreas|IQAndreas]] ([[User talk:IQAndreas|talk]]) 03:05, 9 July 2016 (UTC)
|