Guessing And Compression : A Large Deviations Approach
The problem of guessing a random string is studied. It arises in the analysis of the strength of secret-key cryptosystems against guessing attacks. Expected number of guesses, or more generally moments of the number of guesses needed to break the cryptosystem grow exponentially with the length of th...
Main Author: | |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/2005/1106 |