矩阵NTRU密码体制参数研究

TP309.2; 随着量子计算机的快速发展,后量子密码逐渐成为密码学研究热点.目的 为了避免矩阵NTRU和NTRU一样出现解密失败的情况,对Matrix NTRU算法进行优化.方法 根据同余密码算法对参数空间约束的方法,提出一种矩阵NTRU密码体制参数空间的优化选择方法.该方法重新定义参数空间,精确优化参数选择,通过对原有参数空间进行压缩,将矩阵元素的运算控制在一定范围内,避免因为模越界而解密失败的情况.结果 理论分析表明,优化后的矩阵NTRU算法可以避免加解密失败的情况.为检测优化后的矩阵NTRU性能,对改进后的矩阵NTRU和NTRU2种密码算法在密钥和明文安全性、密钥长度、密文扩展、加解密...

Full description

Saved in:
Bibliographic Details
Published in河南理工大学学报(自然科学版) Vol. 44; no. 2; pp. 138 - 144
Main Authors 李子臣, 吴庆豪, 宋佳烁, 彭海朋
Format Journal Article
LanguageChinese
Published 北京印刷学院 信息工程学院,北京 102600%北京邮电大学 网络空间安全学院,北京 100876 01.03.2025
Subjects
Online AccessGet full text
ISSN1673-9787
DOI10.16186/j.cnki.1673-9787.2023100040

Cover

Abstract TP309.2; 随着量子计算机的快速发展,后量子密码逐渐成为密码学研究热点.目的 为了避免矩阵NTRU和NTRU一样出现解密失败的情况,对Matrix NTRU算法进行优化.方法 根据同余密码算法对参数空间约束的方法,提出一种矩阵NTRU密码体制参数空间的优化选择方法.该方法重新定义参数空间,精确优化参数选择,通过对原有参数空间进行压缩,将矩阵元素的运算控制在一定范围内,避免因为模越界而解密失败的情况.结果 理论分析表明,优化后的矩阵NTRU算法可以避免加解密失败的情况.为检测优化后的矩阵NTRU性能,对改进后的矩阵NTRU和NTRU2种密码算法在密钥和明文安全性、密钥长度、密文扩展、加解密速度方面进行对比分析.选取合适d值,优化后的矩阵NTRU算法的信息与密钥的安全性大于NTRU算法的信息与密钥安全性的数倍,而公钥长度、私钥长度和密文扩展与NTRU方案相同.优化矩阵NTRU算法的加解密速度是NTRU算法的n倍.最后通过实验进一步验证了优化后的矩阵NTRU效率,加解密速度与理论分析相符.结论 优化参数后的矩阵NTRU具有加解密正确、高效等特点.
AbstractList TP309.2; 随着量子计算机的快速发展,后量子密码逐渐成为密码学研究热点.目的 为了避免矩阵NTRU和NTRU一样出现解密失败的情况,对Matrix NTRU算法进行优化.方法 根据同余密码算法对参数空间约束的方法,提出一种矩阵NTRU密码体制参数空间的优化选择方法.该方法重新定义参数空间,精确优化参数选择,通过对原有参数空间进行压缩,将矩阵元素的运算控制在一定范围内,避免因为模越界而解密失败的情况.结果 理论分析表明,优化后的矩阵NTRU算法可以避免加解密失败的情况.为检测优化后的矩阵NTRU性能,对改进后的矩阵NTRU和NTRU2种密码算法在密钥和明文安全性、密钥长度、密文扩展、加解密速度方面进行对比分析.选取合适d值,优化后的矩阵NTRU算法的信息与密钥的安全性大于NTRU算法的信息与密钥安全性的数倍,而公钥长度、私钥长度和密文扩展与NTRU方案相同.优化矩阵NTRU算法的加解密速度是NTRU算法的n倍.最后通过实验进一步验证了优化后的矩阵NTRU效率,加解密速度与理论分析相符.结论 优化参数后的矩阵NTRU具有加解密正确、高效等特点.
Abstract_FL With the rapid development of quantum computers,post-quantum cryptography has emerged as a prominent area of research in cryptography.Objectives In order to avoid the decryption failure in matrix NTRU as NTRU,the Matrix NTRU algorithm was optimized.Methods Based on the method of constraining the parameter space in congruent cryptographic algorithms,a method for optimal selection of the parameter space of matrix NTRU cryptographic regimes was proposed.This method redefined the parameter space and accurately improved the choice of parameters,allowing control of the operation of matrix elements within a specific range.By compressing the original parameter space,decryption failures caused by modulo opera-tions going out of bounds were avoided.Results It was theoretically proved that the improved matrix NTRU algorithm avoided encryption and decryption failures.In order to test the performance of the improved ma-trix NTRU,a theoretical analysis was first carried out.The improved matrix NTRU and NTRU cipher algo-rithms were compared and analyzed in terms of key and plaintext security,key length,ciphertext exten-sion,encryption and decryption speed.By choosing a suitable value of d,the message and key security of the improved matrix NTRU algorithm was several times greater than the message and key security of the NTRU algorithm.The public and private key lengths and ciphertext extensions are the same as in the NTRU scheme.The improved matrix NTRU algorithm is n times faster than the NTRU algorithm for encryp-tion and decryption.Finally,the efficiency of the improved matrix NTRU was further verified by experi-ments,and the encryption and decryption speeds were consistent with the theoretical analysis.Conclusions The result indicated that the matrix NTRU algorithm,optimized with adjusted parameters,possessed char-acteristics such as accurate encryption and decryption,as well as high efficiency.
Author 吴庆豪
宋佳烁
彭海朋
李子臣
AuthorAffiliation 北京印刷学院 信息工程学院,北京 102600%北京邮电大学 网络空间安全学院,北京 100876
AuthorAffiliation_xml – name: 北京印刷学院 信息工程学院,北京 102600%北京邮电大学 网络空间安全学院,北京 100876
Author_FL LI Zichen
WU Qinghao
SONG Jiashuo
PENG Haipeng
Author_FL_xml – sequence: 1
  fullname: LI Zichen
– sequence: 2
  fullname: WU Qinghao
– sequence: 3
  fullname: SONG Jiashuo
– sequence: 4
  fullname: PENG Haipeng
Author_xml – sequence: 1
  fullname: 李子臣
– sequence: 2
  fullname: 吴庆豪
– sequence: 3
  fullname: 宋佳烁
– sequence: 4
  fullname: 彭海朋
BookMark eNo9j71KA0EUhaeIYIx5CbGw2fXeuTt_pQT_IChIUoeZ7E7IKhNwEaOdFmKXQgU706bSxnS-jeviW7igyCkO5yvO4ayxRpiEjLFNhBglarmdx8NwOq6DosgorWIOnBAAEmiw5j9eZe2iGDvAWkTAm2yjell8P78f9U765etdNb_5_Hgo75fl7Pbr6a2aP1aL5Tpb8fasyNp_3mL9vd1e5yDqHu8fdna6UYEgRCSI0IFLpU-4tzo11nBSKHBITovUuEQjSpmZhCykytmMpPep1N4pCcZQi2399l7a4G0YDfLJxXmoFwf59Wh6NXX1JwEcUNAPToRPgw
ClassificationCodes TP309.2
ContentType Journal Article
Copyright Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID 2B.
4A8
92I
93N
PSX
TCJ
DOI 10.16186/j.cnki.1673-9787.2023100040
DatabaseName Wanfang Data Journals - Hong Kong
WANFANG Data Centre
Wanfang Data Journals
万方数据期刊 - 香港版
China Online Journals (COJ)
China Online Journals (COJ)
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
DocumentTitle_FL Study on the parameters of the matrix NTRU cryptosystem
EndPage 144
ExternalDocumentID jzgxyxb202502015
GrantInformation_xml – fundername: (国家自然科学基金); (北京市教委科研计划项目); (北京市教委科研计划项目); (北京市教委科研计划项目); (北京印刷学院博士启动金资助项目); (北京印刷学院科研创新团队项目); (北京印刷学院校内学科建设项目); (北京印刷学院重点教改项目); (北京印刷学院科研基础研究一般项目); (北京市高等教育学会课题资助项目)
  funderid: (国家自然科学基金); (北京市教委科研计划项目); (北京市教委科研计划项目); (北京市教委科研计划项目); (北京印刷学院博士启动金资助项目); (北京印刷学院科研创新团队项目); (北京印刷学院校内学科建设项目); (北京印刷学院重点教改项目); (北京印刷学院科研基础研究一般项目); (北京市高等教育学会课题资助项目)
GroupedDBID 2B.
4A8
92I
93N
ALMA_UNASSIGNED_HOLDINGS
GROUPED_DOAJ
PSX
TCJ
ID FETCH-LOGICAL-s1055-5331b0bd6f42fa8d9a9237151c3b85d9b481166e943a0d7bae36ffd68fb760993
ISSN 1673-9787
IngestDate Thu May 29 04:07:54 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 2
Keywords 矩阵NTRU
解密失败
decryption failure
矩阵环
matrix ring
后量子密码
matrix NTRU
post-quantum cipher
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1055-5331b0bd6f42fa8d9a9237151c3b85d9b481166e943a0d7bae36ffd68fb760993
PageCount 7
ParticipantIDs wanfang_journals_jzgxyxb202502015
PublicationCentury 2000
PublicationDate 2025-03-01
PublicationDateYYYYMMDD 2025-03-01
PublicationDate_xml – month: 03
  year: 2025
  text: 2025-03-01
  day: 01
PublicationDecade 2020
PublicationTitle 河南理工大学学报(自然科学版)
PublicationTitle_FL Journal of Henan Polytechnic University(Natural Science)
PublicationYear 2025
Publisher 北京印刷学院 信息工程学院,北京 102600%北京邮电大学 网络空间安全学院,北京 100876
Publisher_xml – name: 北京印刷学院 信息工程学院,北京 102600%北京邮电大学 网络空间安全学院,北京 100876
SSID ssib010103302
ssj0003314027
ssib006704847
ssib051373601
ssib036434603
ssib031741050
ssib005319289
ssib002423915
ssib011070700
ssib008679455
ssib006595874
Score 2.4163048
Snippet TP309.2; 随着量子计算机的快速发展,后量子密码逐渐成为密码学研究热点.目的 为了避免矩阵NTRU和NTRU一样出现解密失败的情况,对Matrix NTRU算法进行优化.方法...
SourceID wanfang
SourceType Aggregation Database
StartPage 138
Title 矩阵NTRU密码体制参数研究
URI https://d.wanfangdata.com.cn/periodical/jzgxyxb202502015
Volume 44
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NaxQxFB9KBfEiiorfVGlOZepk8n2c2c5SBHuQXeitTHZm6gesYFuovelBvHlQwZu99qQXe_O_cV38L3wvE3diW6R6GbKTl7yPXzZ5L2ReomhRpzZljahixYWKedrI2NjaxnUJ7r3loq5c4vkHa3J1yO-vi_W5eRacWtrZtsujvRO_K_kfVOEd4Ipfyf4DsrNO4QWUAV94AsLwPBXGpFDE9ElmSGGI0SQXa4OHQ1IIkvWJllidJeArkoKTfIUYhlUa6KQrAE1KCkmMIHniiQ13BQM0od-KZHlK8rYH6Eo53onjAs2hiXB8OcmUK6yQTAYFSXTmaPok76EMhSYaWmXYj-ZOJIVtDQ1aQZVxxG2r2aaFk3qF6MLTgiC-P9aRCHydcydf5gQFzSmwDEmygujc2we1A46MaBqSQA2wQAM4RZE1yJKH-yWp6A6MuRHuzNRzZuLIPet5w6GhWwxCMwF6hmTpkqMGQKkzGEUYO-vCUzthjzaDv8lxfksU87glJBUnyWIQetAdQeSo2DHslrAOBw11hRyV9iMjc5yVty1a0DgeAgU8tXSYpTBYEqVisVHeLfJrZpuz088NabAA0jZXj_elaEt3bJnGSxrcOj0aP328POOwnGI2Qgwzks49mR0afbK3ufti1yKmEONgYokzqQKHOdhH8T4nXnrwxyKTBlcqYAJNHcQ8UsEiFsTUmIGSdx9rU7wIJciRh_slSZDTEvxvPCnd_QYXn8vuaIOgTDHpz3age8gY5Ym7Snqm99lo8bdV7v3FJu67wnFTjjcDF3hwITrvY9eFrJ2ILkZze48uRXennw5-fvyKE8_k8-vp_svv395N3hxO3r768eHLdP_99ODwcjTsF4PeauwvXom38L7cGEJAahNbyQYm71JXpoQwUEFsMGJWi8pYrimVsjaclUmlbFkz2TSV1I1VEkJOdiWaHz8b11ejBUwAOmpGMKQa9BVqa82oEiW4WDYxaVVfi-54nTb8xLq1cRTo66eguRGd6_7sN6P57ec79S0IF7btbTc8fgHjwLau
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E7%9F%A9%E9%98%B5NTRU%E5%AF%86%E7%A0%81%E4%BD%93%E5%88%B6%E5%8F%82%E6%95%B0%E7%A0%94%E7%A9%B6&rft.jtitle=%E6%B2%B3%E5%8D%97%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6%E5%AD%A6%E6%8A%A5%EF%BC%88%E8%87%AA%E7%84%B6%E7%A7%91%E5%AD%A6%E7%89%88%EF%BC%89&rft.au=%E6%9D%8E%E5%AD%90%E8%87%A3&rft.au=%E5%90%B4%E5%BA%86%E8%B1%AA&rft.au=%E5%AE%8B%E4%BD%B3%E7%83%81&rft.au=%E5%BD%AD%E6%B5%B7%E6%9C%8B&rft.date=2025-03-01&rft.pub=%E5%8C%97%E4%BA%AC%E5%8D%B0%E5%88%B7%E5%AD%A6%E9%99%A2+%E4%BF%A1%E6%81%AF%E5%B7%A5%E7%A8%8B%E5%AD%A6%E9%99%A2%2C%E5%8C%97%E4%BA%AC+102600%25%E5%8C%97%E4%BA%AC%E9%82%AE%E7%94%B5%E5%A4%A7%E5%AD%A6+%E7%BD%91%E7%BB%9C%E7%A9%BA%E9%97%B4%E5%AE%89%E5%85%A8%E5%AD%A6%E9%99%A2%2C%E5%8C%97%E4%BA%AC+100876&rft.issn=1673-9787&rft.volume=44&rft.issue=2&rft.spage=138&rft.epage=144&rft_id=info:doi/10.16186%2Fj.cnki.1673-9787.2023100040&rft.externalDocID=jzgxyxb202502015
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjzgxyxb%2Fjzgxyxb.jpg