Talk:Cryptographic hash function
|
|
| Missing image Key-crypto-sideways.png WikiProject on Cryptography | This article is part of WikiProject Cryptography, an attempt to build a comprehensive and detailed guide to cryptography in the Wikipedia. If you would like to participate, you can choose to edit the article attached to this page, or visit the project page, where you can join the project and see a list of open tasks. |
|
Pending tasks for [[Template:Articlespace:Cryptographic hash function]]: (https://academickids.com:443/encyclopedia/index.php?title=Talk:Cryptographic_hash_function&action=purge) | edit (https://academickids.com:443/encyclopedia/index.php?title=Talk:Cryptographic_hash_function/to_do&action=edit) - watch (https://academickids.com:443/encyclopedia/index.php?title=Talk:Cryptographic_hash_function/to_do&action=watch) - purge (https://academickids.com:443/encyclopedia/index.php?title=Talk:Cryptographic_hash_function&action=purge) | |
|---|---|---|
| ||
Revision of article
I agree that the account given here currently is accurate. It is however, quite abstract and so less than useful to a large class of readers. Since the topic is a fundamental one in modern cryptographic practice, I suggest that this article be revised to include some text giving more context. In particular, problems in using such function should be noted. The article message digest errs in almost the inverse way. Perhaps a combination of the two with redirect pointers?
I will consider taking it on, as time allows, if no one else does.
ww
- I've merged these (though it needs reorganising, I think). — Matt 22:18, 19 Jul 2004 (UTC)
— Matt 01:14, 21 Jul 2004 (UTC)
Feel free to put these observations on the todo list as you wish. The article needs to discuss at least qualitatively what "hard" is meant in the properties section. Examples or just order of magnitude of the computation involved would be fine. A link to and/or a quick summary of what computational infeasibility means are needed too. Also of course, a summary of the different CHF's and their features/similarities. - Taxman 20:23, Jul 29, 2004 (UTC)
Online references for editing
- HAC chapter (http://www.cacr.math.uwaterloo.ca/hac/about/chap9.pdf)
- Draft encyclo. article (http://www.win.tue.nl/~henkvt/hashv4.pdf)
- RSA FAQs: [1] (http://www.rsasecurity.com/rsalabs/node.asp?id=2176)
- Remote physical device fingerprinting (http://www.cse.ucsd.edu/users/tkohno/papers/PDF/)
[2] (http://www.rsasecurity.com/rsalabs/node.asp?id=2205) [3] (http://www.rsasecurity.com/rsalabs/node.asp?id=2258) [4] (http://www.rsasecurity.com/rsalabs/node.asp?id=2253)
I feel the intro is too long (i.e a section heading should be inserted after the first paragraph) but I can't think of anything suitable. Arvindn 07:33, 30 Jul 2004 (UTC)
I'd say the puzzle solution example is about commitment more than timestamping. Lunkwill 00:27, 5 Aug 2004 (UTC)
On "dramatically different" - this is a requirement of hash functions, it's the Strong Avalanche Criterion.
On "no information about" - an attacker can trivially determine one piece of information about M from H(M), namely the value of H(M). I understand the spirit of what you're trying to get across but no-one's ever found a way to express it formally in a way that's not impossible to satisfy.
ciphergoth 11:24, 2005 Jan 10 (UTC)
"Some of the following algorithms are known to be insecure"
- please note the ones that are and how significant each is. - Omegatron 16:44, Apr 14, 2005 (UTC)
There is some discussion of the security elsewhere in the article, but here I would suggest we just remove the warning altogether. Just because we list a hash function design doesn't carry any implication that it's somehow endorsed (any more than a "list of prisons" article would carry the disclaimer that "some of the following prisons are known to have had inmates escape"). — Matt Crypto 19:10, 14 Apr 2005 (UTC)
- Why not? That's the information I was looking for in this case. Several of the articles have something like "this version is no longer considered secure" in the first description paragraph. - Omegatron 19:18, Apr 14, 2005 (UTC)