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., Duffy, Ken R., Medard, Muriel, Calmon, Flavio du Pin
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2014
Online Access:http://hdl.handle.net/1721.1/90432
https://orcid.org/0000-0003-2912-7972
https://orcid.org/0000-0003-4059-407X