一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名
郵箱
手機號碼
標題
留言內(nèi)容
驗證碼

關(guān)于非對稱含錯學習問題的困難性研究

張江 范淑琴

張江, 范淑琴. 關(guān)于非對稱含錯學習問題的困難性研究[J]. 電子與信息學報, 2020, 42(2): 327-332. doi: 10.11999/JEIT190685
引用本文: 張江, 范淑琴. 關(guān)于非對稱含錯學習問題的困難性研究[J]. 電子與信息學報, 2020, 42(2): 327-332. doi: 10.11999/JEIT190685
Jiang ZHANG, Shuqin FAN. On the Hardness of the Asymmetric Learning With Errors Problem[J]. Journal of Electronics & Information Technology, 2020, 42(2): 327-332. doi: 10.11999/JEIT190685
Citation: Jiang ZHANG, Shuqin FAN. On the Hardness of the Asymmetric Learning With Errors Problem[J]. Journal of Electronics & Information Technology, 2020, 42(2): 327-332. doi: 10.11999/JEIT190685

關(guān)于非對稱含錯學習問題的困難性研究

doi: 10.11999/JEIT190685
基金項目: 國家重點研發(fā)計劃(2017YFB0802005, 2018YFB0804105),國家自然科學基金(61602046, 61932019),中國科協(xié)“青年人才托舉工程”(2016QNRC001)
詳細信息
    作者簡介:

    張江:男,1986年生,副研究員,主要研究方向為基于格的密碼協(xié)議及其可證明安全

    范淑琴:女,1978年生,教授,主要研究方向為基于格的密碼分析

    通訊作者:

    張江 jiangzhang09@gmail.com

  • 中圖分類號: TN918, TP309.7

On the Hardness of the Asymmetric Learning With Errors Problem

Funds: The National Key Research and Development Program of China (2017YFB0802005, 2018YFB0804105), The National Natural Science Foundation of China (61602046, 61932019), The Young Elite Scientists Sponsorship Program by China Association for Science and Technology (2016QNRC001)
  • 摘要: 由于基于最壞情況困難假設(shè)等優(yōu)點,基于格的密碼被認為是最具前景的抗量子密碼研究方向。作為格密碼的常用的兩個主要困難問題之一,含錯學習(LWE)問題被廣泛用于密碼算法的設(shè)計。為了提高格密碼算法的性能,Zhang等人(2019)提出了非對稱含錯學習問題,該文將從理論上詳細研究非對稱含錯學習問題和標準含錯學習問題關(guān)系,并證明在特定錯誤分布下非對稱含錯學習問題和含錯學習問題是多項式時間等價的,從而為基于非對稱含錯學習問題設(shè)計安全的格密碼算法奠定了理論基礎(chǔ)。
  • 圖  1  高斯分布和二項分布

  • SHOR P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Journal on Computing, 1997, 26(5): 1484–1509. doi: 10.1137/S0097539795293172
    NSA. National Security Agency. Cryptography today[EB/OL]. https://www.nsa.gov/ia/programs/suiteb_cryptography/, 2015.
    NIST. Post-quantum cryptography standardization[EB/OL]. http://csrc.nist.gov/groups/ST/post-quantum-crypto/submission-requirements/index.html, 2016.
    中國科學技術(shù)學會. 科普時報: 中國科協(xié)發(fā)布12個領(lǐng)域60大科技難題[EB/OL]. http://www.cast.org.cn/art/2018/6/22/art_90_77662.html, 2018.
    REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]. The 37th Annual ACM Symposium on Theory of Computing, Baltimore, USA, 2005: 84–93.
    AJTAI M. Generating hard instances of lattice problems (extended abstract)[C]. The 28th Annual ACM Symposium on Theory of Computing, Philadelphia, USA,1996: 99–108.
    ZHANG Jiang, YU Yu, FAN Shuqin, et al. Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes[R]. Cryptology ePrint Archive 2019/510, 2019.
    APPLEBAUM B, CASH D, PEIKERT C, et al. Fast cryptographic primitives and circular-secure encryption based on hard learning problems[C]. The 29th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 2009: 595–618.
    MICCIANCIO D and REGEV O. Worst-case to average-case reductions based on Gaussian measures[C]. The 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, 2004: 372–381.
    PEIKERT C. An efficient and parallel Gaussian sampler for lattices[C]. The 30th Annual Conference on Advances in Cryptology, Santa Barbara, USA, 2010: 80–97.
  • 加載中
圖(1)
計量
  • 文章訪問數(shù):  2443
  • HTML全文瀏覽量:  940
  • PDF下載量:  102
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2019-09-14
  • 修回日期:  2019-11-20
  • 網(wǎng)絡(luò)出版日期:  2019-11-29
  • 刊出日期:  2020-02-19

目錄

    /

    返回文章
    返回