DocumentCode
1443395
Title
Bounds on entropy in a guessing game
Author
De Santis, Alfredo ; Gaggia, Antonio Giorgio ; Vaccaro, Ugo
Author_Institution
Dipt. di Inf. ed Applicazioni, Salerno Univ., Italy
Volume
47
Issue
1
fYear
2001
fDate
1/1/2001 12:00:00 AM
Firstpage
468
Lastpage
473
Abstract
We consider the guessing problem proposed by Massey (see Proc. Int. Symp. Information Theory, p.204, 1994) of a cryptanalyst that wants to break a ciphertext with a brute-force attack. The best strategy he can use is to try out all possible keys, one at time in order of decreasing probability, after narrowing the possibilities by some cryptanalysis. In this correspondence we provide both upper and lower bounds on the entropy of the probability distribution on the secret keys in terms of the number of secret keys and of the average number of trials of the cryptanalyst
Keywords
cryptography; entropy; probability; brute-force attack; ciphertext decryption; cryptanalysis; cryptanalyst; entropy; guessing game; guessing problem; lower bounds; probability distribution; secret keys; upper bounds; Antenna arrays; Array signal processing; Direction of arrival estimation; Entropy; Fourier transforms; Linear antenna arrays; Narrowband; Sensor arrays; Signal processing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.904564
Filename
904564
Link To Document