Bounds on entropy in a guessing game

被引：11

作者：

De Santis, A ^{[1
]}

Gaggia, AG ^{[1
]}

Vaccaro, U ^{[1
]}

机构：

[1] Univ Salerno, Dipartimento Informat & Applicaz, I-84081 Baronissi, SA, Italy

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2001年 / 47卷 / 01期

关键词：

entropy; guessing; probability;

D O I：

10.1109/18.904564

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider the yessing problem proposed by Massey [1] 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.

引用

页码：468 / 473

页数：6