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

基于配对的密码学的安全性分析

Security Analysis of Pairing-based Cryptography

Xiaofeng Wang, Peng Zheng, Qianqian Xing

AI总结:

本文从渐近复杂度三个视角系统回顾了数域筛算法,评估了标准化PF曲线安全性,发现BN256曲线仅99.92比特安全,并分析了不同安全级别下BN、BLS和KSS曲线的最优效率选择。

摘要:

数域筛法(NFS)的最新进展动摇了基于配对的密码学的安全性。针对有限域上的离散对数问题(DLP),我们从渐近复杂度 $L_Q\left(α,c\right)$ 中的度 $α$、常数 $c$ 和隐藏常数 $o(1)$ 三个视角对 NFS 算法进行了首次系统性回顾,并指出需要进一步研究以优化隐藏常数。利用特殊的扩展塔 NFS 算法,我们对所有现有的标准化 PF 曲线以及几种常用曲线进行了彻底的安全性评估,结果表明 SM9 和之前的 ISO/IEC 标准推荐的 BN256 曲线仅表现出 99.92 比特的安全性,显著低于预期的 128 比特水平。此外,我们全面分析了不同安全级别下 BN、BLS 和 KSS 曲线的安全性与效率。我们的分析表明,对于低于约 105 比特的安全强度,BN 曲线表现出卓越的效率。对于 128 比特安全级别,BLS12 和 BLS24 曲线是最佳选择,而对于 160bit、192bit 和 256bit 安全级别,BLS24 曲线提供了最佳效率。

英文摘要:

Recent progress in number field sieve (NFS) has shaken the security of Pairing-based Cryptography. For the discrete logarithm problem (DLP) in finite field, we present the first systematic review of the NFS algorithms from three perspectives: the degree $α$, constant $c$, and hidden constant $o(1)$ in the asymptotic complexity $L_Q\left(α,c\right)$ and indicate that further research is required to optimize the hidden constant. Using the special extended tower NFS algorithm, we conduct a thorough security evaluation for all the existing standardized PF curves as well as several commonly utilized curves, which reveals that the BN256 curves recommended by the SM9 and the previous ISO/IEC standard exhibit only 99.92 bits of security, significantly lower than the intended 128-bit level. In addition, we comprehensively analyze the security and efficiency of BN, BLS, and KSS curves for different security levels. Our analysis suggests that the BN curve exhibits superior efficiency for security strength below approximately 105 bit. For a 128-bit security level, BLS12 and BLS24 curves are the optimal choices, while the BLS24 curve offers the best efficiency for security levels of 160bit, 192bit, and 256bit.

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

↑