Abstract
This work has been inspired by problems addressed in the field of computer security, where the attacking of, e.g., password systems is an important issue. In [2] Lundin et al. discuss measures related to the number of guesses or attempts a supposed attacker needs for revealing information. Here several numerical approaches are discussed for evaluating the average number of successive guesses required for correctly guessing the value of a string of independent and identically-distributed random variables. The guessing strategy used is guessing strings in decreasing order of probability [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arikan, E.: An Inequality on Guessing and its Application to Sequential Decoding. IEEE Transactions on Information Theory 42(1), 99–105 (1996)
Lundin, R., Lindskog, S., Brunström, A., Fischer-Hübner, S.: Using guesswork as a measure for confidentiality of selectivly encrypted messages. Advances in Information Security 23(pt. 4), 173–184 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersson, K. (2012). Numerical Evaluation of the Average Number of Successive Guesses. In: Durand-Lose, J., Jonoska, N. (eds) Unconventional Computation and Natural Computation. UCNC 2012. Lecture Notes in Computer Science, vol 7445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32894-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-32894-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32893-0
Online ISBN: 978-3-642-32894-7
eBook Packages: Computer ScienceComputer Science (R0)