Jump to content

Talk:Key clustering

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Duckmather (talk | contribs) at 20:44, 3 June 2021 (Equivalent keys vs key clustering: Reply). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconCryptography: Computer science Unassessed
WikiProject iconThis article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography 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.
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the importance scale.
Taskforce icon
This article is supported by 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]