arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.12455cs.ITmath.IT
收藏

基于素数的识别码

Identification Codes via Prime Numbers

Emad Zinoghli, Mohammad Javad Salariseddigh

AI总结:

本文提出基于无噪信道素数生成的识别码构造方法,通过引入概率素数生成算法将密钥生成降至多项式时间,推导了type II上界改进,并提出基于哈希函数的广义识别编码方法。

摘要:

我们提出了一种基于无噪信道上素数生成来构造识别码的方法。最早基于素数的此类构造方法由Ahlswede提出,该方法依赖于素数生成算法。对于块长度为$n$的识别码,该方法需要知道前$2^n$个素数,这在计算上并不高效。在本研究中,我们重新审视了Ahlswede的方案并提出了若干修改。具体而言,通过采用概率素数生成算法,我们保证了素数密钥能够在多项式时间内生成。此外,我们还推导并给出了关于type II上界的额外改进。最后,我们提出了一种基于哈希函数的识别编码方法,该方法推广了Ahlswede的方案。

英文摘要:

We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime keys generation is possible in polynomial time. Furthermore, additional improvements in terms of type II upper bound are derived and presented. Finally, we propose a method for identification coding based on hash functions which generalizes the Ahlswede's scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑