The Forgery Attack on the Post-Quantum AJPS-2 Cryptosystem and Modification of the AJPS-2 Cryptosystem by Changing the Class of Numbers Used as a Module

Dariya Yadukha
{"title":"The Forgery Attack on the Post-Quantum AJPS-2 Cryptosystem and Modification of the AJPS-2 Cryptosystem by Changing the Class of Numbers Used as a Module","authors":"Dariya Yadukha","doi":"10.20535/tacs.2664-29132023.1.286166","DOIUrl":null,"url":null,"abstract":"In recent years, post-quantum (quantum-resistant) cryptography has been actively researched, in particular, due to the National Institute of Standards and Technology's (NIST) Post-Quantum Cryptography Competition (PQC), which has been running since 2017. One of the participants in the first round of the competition is the Mersenne-756839 key encapsulation mechanism based on the AJPS-2 encryption scheme. The arithmetic modulo Mersenne number is used to construct the cryptoprimitives of the AJPS family. In this paper, we propose a forgery attack on the AJPS-2 cryptosystem using an active eavesdropper, and two modifications of the post-quantum AJPS-2 cryptosystem, namely, the modification of AJPS-2 using the arithmetic modulo generalized Mersenne number and Crandall number. Moreover, new algebraic problems are defined, on the complexity of which the security of the created modifications is based. The advantages of these modifications are the extension of the number class used as a module in the cryptosystem and the security against the forgery attack with the active eavesdropper, which was successful in the original AJPS-2.","PeriodicalId":471817,"journal":{"name":"Theoretical and applied cybersecurity","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical and applied cybersecurity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20535/tacs.2664-29132023.1.286166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, post-quantum (quantum-resistant) cryptography has been actively researched, in particular, due to the National Institute of Standards and Technology's (NIST) Post-Quantum Cryptography Competition (PQC), which has been running since 2017. One of the participants in the first round of the competition is the Mersenne-756839 key encapsulation mechanism based on the AJPS-2 encryption scheme. The arithmetic modulo Mersenne number is used to construct the cryptoprimitives of the AJPS family. In this paper, we propose a forgery attack on the AJPS-2 cryptosystem using an active eavesdropper, and two modifications of the post-quantum AJPS-2 cryptosystem, namely, the modification of AJPS-2 using the arithmetic modulo generalized Mersenne number and Crandall number. Moreover, new algebraic problems are defined, on the complexity of which the security of the created modifications is based. The advantages of these modifications are the extension of the number class used as a module in the cryptosystem and the security against the forgery attack with the active eavesdropper, which was successful in the original AJPS-2.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
后量子AJPS-2密码系统的伪造攻击及AJPS-2密码系统的修改
近年来,后量子(抗量子)密码学得到了积极的研究,特别是由于自2017年以来一直在运行的美国国家标准与技术研究院(NIST)后量子密码学竞赛(PQC)。第一轮竞赛的参与者之一是基于AJPS-2加密方案的Mersenne-756839密钥封装机制。利用算术模梅森数构造了AJPS族的密码基元。本文提出了一种利用有源窃听器对AJPS-2密码系统进行伪造攻击的方法,并对后量子AJPS-2密码系统进行了两种修改,即利用算术模广义梅森数和克兰德尔数对AJPS-2进行修改。此外,还定义了新的代数问题,所创建的修改的安全性基于复杂性。这些修改的优点是扩展了作为密码系统模块的数字类,并且增加了主动窃听器对伪造攻击的安全性,这在原来的AJPS-2中已经取得了成功。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Malware detection system based on static and dynamic analysis and using machine learning Cryptanalysis of the «Vershyna» digital signature algorithm The Development of the Solution Search Method Based on the Improved Bee Colony Algorithm Complexity of The Systems of Linear Restrictions over a Finite Field Vulnerability classification using Q-analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1