摘要
本文研究以下情况时的保密增强，存在一个二元离散无记忆广播信源以非常高的速率广 播随机比特串，并已知敌手的存储容量有限、计算能力无限。得出了通信双方以一定的概率提取 出一个高度保密的秘密钥长度的下界以及敌手关于秘密钥信息量的上界。
This paper investigates privacy amplification, in which there exists a binary disrete memoryless broad- cast source which transmitting data at very high a rate, and an adversary's memory capacity is limited, no as- sumption about his computing power is made. With some probability, the upper bound of the secret-key size dis- tilled safel by two legitimate parties and the lower bound of adversary' information about the secret-key are obtained.
出处
《通信学报》
EI
CSCD
北大核心
2001年第10期1-5,共5页
Journal on Communications
基金
国家自然科学基金资助项目(69972034)
国防科技重点实验室基金资助项目(99JS06.3.1.DZ0112)
