Talk:Key clustering

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles 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 scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Equivalent keys vs key clustering

Is key clustering exactly the same as equivalent keys? The article is not clear enough whether "clustered keys" in the presence of different plaintexts must also produce the same ciphertexts or not. -- intgr [talk] 11:47, 20 July 2017 (UTC)[reply]

No, key clustering is very different from the issue of equivalent keys. It's an issue having to do with hash tables; namely, that if the hash of two keys are the same, then the values must basically be stored in old-fashioned lists, which causes hash table lookup times to increase. (I'll get rid of the misleading WikiProject Cryptography header and replace it with a WikiProject Computer Science one.) Duckmather (talk) 20:44, 3 June 2021 (UTC)[reply]