Key Space (cryptography)
In cryptography, an algorithm's key space refers to the set of all possible keys that can be used to initialize it. For example, if an algorithm works using a key that is a string of 10 bits, then its key space is the set of all binary strings of length 10. i.e. we have key space of size 210 = 1024.
To avoid adversaries from guessing the key using a brute-force attack, the key space is usually designed to be extremely large. Another desirable attribute is that the key space be flat, having no or very few weak keys. If the key was selected randomly from all possible keys, on average half the key space must be searched to find the solution. However, if an attacker has some knowledge of how the key was likely selected, the search time can be far less.
Read more about Key Space (cryptography): Examples
Famous quotes containing the words key and/or space:
“It so happened that, a few weeks later, “Old Ernie” [Ernest Hemingway] himself was using my room in New York as a hide-out from literary columnists and reporters during one of his rare stopover visits between Africa and Key West. On such all-too-rare occasions he lends an air of virility to my dainty apartment which I miss sorely after he has gone and all the furniture has been repaired.”
—Robert Benchley (1889–1945)
“I would have broke mine eye-strings, cracked them, but
To look upon him, till the diminution
Of space had pointed him sharp as my needle;
Nay, followed him till he had melted from
The smallness of a gnat to air, and then
Have turned mine eye and wept.”
—William Shakespeare (1564–1616)