Talk:Weak key

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Cryptography / Computer science   
WikiProject icon This 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 the quality scale.
 ???  This article has not yet received a rating on the importance scale.
Taskforce icon
This article is supported by WikiProject Computer science.


all ones (FFFFFFFFFFFFFFFF) ones or F:s? —Preceding unsigned comment added by (talk) 17:45, 1 April 2008 (UTC)

Bruteforcing costs[edit]

all keys can be brute-forced in about a day for a one-time hardware cost on the order of some new cards

- I suppose these "new cards" mean some FPGA Boards, which are quite costly. COPACOBANA costs about 10k$ and cracks DES in about 7 days. —Preceding unsigned comment added by (talk) 00:11, 2 December 2010 (UTC)

Why does this require a citation?[edit]

"An algorithm that has unknown weak keys does not inspire much trust[citation needed]." How does this require a citation? It seems like a pretty common sense idea to me. If there are unknown weak keys, then a user could accidentally pick a weak key which a knowledgeable attacker (to whom the weak keys aren't unknown) could take advantage of. Would it suffice to not have a citation if this sentence was rewritten with a less personal tone? — Preceding unsigned comment added by (talk) 19:13, 15 November 2016 (UTC)