Brute force searching, the typical set and Guesswork

Brute force searching, the typical set and Guesswork

Consider the situation where a word is chosen probabilistically from a finite list. If an attacker knows the list and can inquire about each word in turn, then selecting the word via the uniform distribution maximizes the attacker's difficulty, its Guesswork, in identifying the chosen word. It...

Full description

Bibliographic Details
Main Authors: Christiansen, Mark M. (Author), Duffy, Ken R. (Author), Medard, Muriel (Contributor), Calmon, Flavio du Pin (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Research Laboratory of Electronics (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2014-09-29T15:32:41Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items