基于水下噪声信道不确定性的保密通信方案

Confidential communication scheme based on uncertainty of underwater noisy channels

针对水下噪声不确定性对信息传输产生的影响和噪声信道中通信面临的安全问题,提出一种基于水下噪声信道不确定性的保密通信方案。该方案由基于哥德尔编码的交互式密钥提取协议和基于r-循环Toeplitz矩阵的保密增强协议组成。在密钥提取的过程中,通过引入哥德尔编码,减少了密钥序列的比较次数;在计算保密增强后的密钥长度时,考虑了水下噪声的不确定性,具有更强的实际意义。实验结果表明,在满足协议安全性的条件下,传输的总比特数为119 940 bit,保密增强后生成的密钥串总长度的下界为117 331 bit,敌手关于密钥串信息量的上界为2 609 bit,所需时间为11.99 s,并且所提出的(nt+s)×(nt+s)阶r-循环Toeplitz矩阵比传统的同阶Toeplitz矩阵减少了(nt+s)-1 bit存储空间。

Aiming at the influence of the uncertainty of underwater noise on information transmission and the security problem of the communication over noisy channels, a confidential communication scheme based on the uncertainty of underwater noisy channels was proposed. The proposed scheme was composed of an interactive key extraction protocol based on Godel’s code and a privacy amplification protocol based on r-circulant Toeplitz matrix. During the process of key extraction, the key sequence comparing number was reduced through the Godel’s code. When calculating the key length after privacy amplification, the uncertainty of underwater noise was considered to make the proposed scheme more practical. Experimental results show that under the condition of satisfying protocol security, it takes 11.99 s to transmit 119 940 bit string where the lower bound of the generated secret key length is 117 331 bit after privacy amplification and the upper bound of the adversary’s information about the secret key is 2 609 bit. Moreover, the proposed scheme (nt+s)×(nt+s)-order r-circulant Toeplitz matrix decreases (nt+s)?1 bit memory space compared to the traditional Toeplitz matrix with the same order.