摘要
把比特串逐段视为一个二进制数并对此数定义一种位和运算,通过比较比特串对应段的二进制数位和的不同来纠正比特串中的错误比特,从而完成信息协调.该协议即使在最坏的情况下也要比已有的信息协调协议的效率高,而且泄漏的信息量也较少.
The substrings of a bit-string can be regarded as binary numbers on which a digit-sum operation is defined. By comparing the digit-sums of the two substrings, one can locate and correct the error in his substring. The efficiency of our new protocol is much higher than those of all known information reconciliation protocols even in the worst case, and simultaneously, its information leakage is relatively small.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2006年第3期486-490,共5页
Journal of Xidian University
基金
国家自然科学基金资助项目(69972034
60132030)
国家863计划资助项目(2002AA144010)
国家自然科学基金资助项目(60473029)
关键词
无条件安全
密钥协商
信息协调
位和
unconditional security
secret-key agreement
information reconciliation
digit-sum