Guesswork and entropy

Authors:
D. Malone;W. G. Sullivan
Affiliations:
Commun. Network Res. Inst., Dublin Inst. of Technol., Ireland;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Assessing security threats of looping constructs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Overview on selective encryption of image and video: challenges and perspectives

EURASIP Journal on Information Security
Security implications of selective encryption

Proceedings of the 6th International Workshop on Security Measurements and Metrics
Selecting secure passwords

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Investigating the distribution of password choices

Proceedings of the 21st international conference on World Wide Web

Quantified Score

Hi-index	754.84

Visualization

Abstract

We derive the moments of the guesswork , the number of attempts required to correctly guess the output of a random source, for a source determined by a Markov chain via a large deviations type estimate. These moments are related to the Perron-Frobenius eigenvalue of the matrix formed by element-wise powers of the Markov chain's transition matrix.