arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.01495cs.ITcs.CRmath.IT
收藏

非线性密码哈希函数的纠错能力

Error Correction Capabilities of Non-Linear Cryptographic Hash Functions

Alejandro Cohen, Rafael G. L. D'Oliveira

AI总结:

本文利用多址信道技术证明了非线性密码哈希具有良好纠错能力,并证明系统随机非线性码在渐近机制下能达到容量,同时通过SHA与SRLC、S-RNLC的性能比较验证了理论结果。

摘要:

已知线性哈希具有纠错能力。然而,在大多数应用中,使用的是具有伪随机输出的非线性哈希。也已证实,经典的非系统随机码,无论是线性还是非线性,在渐近机制下都能达到容量。因此,有理由预期非线性哈希也可能表现出良好的纠错能力。在本文中,我们证明了情况确实如此。我们的证明基于多址信道的技术。作为一个推论,我们证明了系统随机非线性码(S-RNLC)在渐近机制下能达到容量。我们通过比较安全哈希算法(SHA)与系统随机线性码(SRLC)和S-RNLC的性能来验证我们的结果,证明SHA表现相当。

英文摘要:

Linear hashes are known to possess error-correcting capabilities. However, in most applications, non-linear hashes with pseudorandom outputs are utilized instead. It has also been established that classical non-systematic random codes, both linear and non-linear, are capacity achieving in the asymptotic regime. Thus, it is reasonable to expect that non-linear hashes might also exhibit good error-correcting capabilities. In this paper, we show this to be the case. Our proof is based on techniques from multiple access channels. As a consequence, we show that Systematic Random Non-Linear Codes (S-RNLC) are capacity achieving in the asymptotic regime. We validate our results by comparing the performance of the Secure Hash Algorithm (SHA) with that of Systematic Random Linear Codes (SRLC) and S-RNLC, demonstrating that SHA performs equally.

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

↑