Show simple item record

dc.contributor.authorChristiansen, Mark M.
dc.contributor.authorDuffy, Ken R.
dc.contributor.authorMedard, Muriel
dc.contributor.authorCalmon, Flavio du Pin
dc.date.accessioned2014-09-29T15:32:41Z
dc.date.available2014-09-29T15:32:41Z
dc.date.issued2013-07
dc.identifier.isbn978-1-4799-0446-4
dc.identifier.issn2157-8095
dc.identifier.urihttp://hdl.handle.net/1721.1/90432
dc.description.abstractConsider 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 is tempting to use this property in cryptanalysis of computationally secure ciphers by assuming coded words are drawn from a source's typical set and so, for all intents and purposes, uniformly distributed within it. By applying recent results on Guesswork, for i.i.d. sources it is this equipartition ansatz that we investigate here. In particular, we demonstrate that the expected Guesswork for a source conditioned to create words in the typical set grows, with word length, at a lower exponential rate than that of the uniform approximation, suggesting use of the approximation is ill-advised.en_US
dc.description.sponsorshipUnited States. Dept. of Defense (Air Force Contract FA8721-05-C-0002)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISIT.2013.6620428en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleBrute force searching, the typical set and Guessworken_US
dc.typeArticleen_US
dc.identifier.citationChristiansen, Mark M., Ken R. Duffy, Flavio du Pin Calmon, and Muriel Medard. “Brute Force Searching, the Typical Set and Guesswork.” 2013 IEEE International Symposium on Information Theory (July 2013).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Research Laboratory of Electronicsen_US
dc.contributor.mitauthorCalmon, Flavio du Pinen_US
dc.contributor.mitauthorMedard, Murielen_US
dc.relation.journalProceedings of the 2013 IEEE International Symposium on Information Theoryen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsChristiansen, Mark M.; Duffy, Ken R.; du Pin Calmon, Flavio; Medard, Murielen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-2912-7972
dc.identifier.orcidhttps://orcid.org/0000-0003-4059-407X
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record