Talk:Non-cryptographic hash function

Computer Security: Computing Low‑importance

This article is within the scope of WikiProject Computer Security, a collaborative effort to improve the coverage of computer security on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer SecurityWikipedia:WikiProject Computer SecurityTemplate:WikiProject Computer SecurityComputer Security articles

Low

This article has been rated as Low-importance on the project's importance scale.

This article is supported by WikiProject Computing (assessed as Low-importance).

Things you can help WikiProject Computer Security with:

Article alerts will be generated shortly by AAlertBot. Please allow some days for processing. More information...

Answer question about Same-origin_policy
Review importance and quality of existing articles
Identify categories related to Computer Security
Tag related articles
Identify articles for creation (see also: Article requests)
Identify articles for improvement
Create the Project Navigation Box including lists of adopted articles, requested articles, reviewed articles, etc.
Find editors who have shown interest in this subject and ask them to take a look here.

Merkle–Damgård construction?[edit]

Statement about Merkle–Damgård construction was taken by me from the source, but many simple NCHFs process the data byte-by-byte, which hardly can be classified as normal M-D construct (typically blocks are much larger than a byte and entire data to be hashed is not considered to be a one block). I am thinking of removing the sentence altogether, requesting comments. Dimawik (talk) 05:41, 30 May 2023 (UTC)[reply]

No objections, removed. Dimawik (talk) 09:51, 1 November 2023 (UTC)[reply]

Categories[edit]

The already used Category:Hash function (non-cryptographic) is an obvious match. I cannot figure out any additional categories. I will appreciate any suggestions. Dimawik (talk) 09:15, 30 May 2023 (UTC)[reply]