术语 | key equivocation |
释义 | key equivocation 密钥混度 In information theory, the equivocation of a key in relation to receipt of a given ciphertext, given by Hc(K)=-∑P(C)∑Pc(K)log2(Pc(K)) where P(C) is the probability of receipt of ciphertext C, and Pc(K) is the probability that the key K was employed given that ciphertext C was received. If the key equivocation is zero then there is no uncertainty of the key employed. Key equivocation usually decreases as the length of the message is increased. 在信息论中,用以表示收到已知密文和密钥的关系,即 Hc(K)=-∑P(C)∑Pc(K)log2(Pc(K)) 其中P(C)是收到密文C的概率,Pc(K)是收到密文C后用指定的密钥K的条件概率。若密钥 混度等于零,则用上密钥K无不确定性。一般说来,信息长度增加,密钥混度将下降。 |
随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条,基本涵盖了全部常用计算机术语的翻译及用法,是计算机学习及翻译工作的有利工具。