基于整数模环的奇异矩阵公钥密码系统推广

Maxrizal, B. D. A. Prayanti, Sujono
{"title":"基于整数模环的奇异矩阵公钥密码系统推广","authors":"Maxrizal, B. D. A. Prayanti, Sujono","doi":"10.1109/ICORIS56080.2022.10031349","DOIUrl":null,"url":null,"abstract":"In this research, we modify the cryptosystem from a ring over an integer to an integer modulo m. In the previous research, the researcher used a singular matrix over integers so that the plaintext and ciphertext spaces became relatively large. For this reason, in this study, we limit the ring over the integer to the ring over integer mod m. We provide proposed modifications and simulations of key generation protocol, encryption and description. The results show that the proposed public key cryptosystem can work well and remain safe from mathematical attacks that hackers may carry out. The use of modulo m can also limit the plaintext and ciphertext space. In addition, the concept of modulo m makes the message more random and difficult to guess.","PeriodicalId":138054,"journal":{"name":"2022 4th International Conference on Cybernetics and Intelligent System (ICORIS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalization of Public Key Cryptosystem Based on Singular Matrix Using Ring of Integer Modulo\",\"authors\":\"Maxrizal, B. D. A. Prayanti, Sujono\",\"doi\":\"10.1109/ICORIS56080.2022.10031349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research, we modify the cryptosystem from a ring over an integer to an integer modulo m. In the previous research, the researcher used a singular matrix over integers so that the plaintext and ciphertext spaces became relatively large. For this reason, in this study, we limit the ring over the integer to the ring over integer mod m. We provide proposed modifications and simulations of key generation protocol, encryption and description. The results show that the proposed public key cryptosystem can work well and remain safe from mathematical attacks that hackers may carry out. The use of modulo m can also limit the plaintext and ciphertext space. In addition, the concept of modulo m makes the message more random and difficult to guess.\",\"PeriodicalId\":138054,\"journal\":{\"name\":\"2022 4th International Conference on Cybernetics and Intelligent System (ICORIS)\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 4th International Conference on Cybernetics and Intelligent System (ICORIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICORIS56080.2022.10031349\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Cybernetics and Intelligent System (ICORIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICORIS56080.2022.10031349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本研究中,我们将密码系统从整数上的环修改为整数模m。在之前的研究中,研究者使用整数上的奇异矩阵,使得明文和密文空间变得相对较大。因此,在本研究中,我们将整数上的环限制为整数上的环mod m。我们提出了修改和模拟密钥生成协议,加密和描述。结果表明,所提出的公钥密码系统可以很好地工作,并且可以免受黑客可能进行的数学攻击。模m的使用也可以限制明文和密文的空间。此外,模m的概念使消息更加随机和难以猜测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generalization of Public Key Cryptosystem Based on Singular Matrix Using Ring of Integer Modulo
In this research, we modify the cryptosystem from a ring over an integer to an integer modulo m. In the previous research, the researcher used a singular matrix over integers so that the plaintext and ciphertext spaces became relatively large. For this reason, in this study, we limit the ring over the integer to the ring over integer mod m. We provide proposed modifications and simulations of key generation protocol, encryption and description. The results show that the proposed public key cryptosystem can work well and remain safe from mathematical attacks that hackers may carry out. The use of modulo m can also limit the plaintext and ciphertext space. In addition, the concept of modulo m makes the message more random and difficult to guess.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信