Elliptic curve matrices over group ring to improve elliptic curve–discrete logarithm cryptosystems

Qasim Mohsin Luhaib, Ruma Kareem K. Ajeena
{"title":"Elliptic curve matrices over group ring to improve elliptic curve–discrete logarithm cryptosystems","authors":"Qasim Mohsin Luhaib, Ruma Kareem K. Ajeena","doi":"10.47974/jdmsc-1616","DOIUrl":null,"url":null,"abstract":"An elliptic curve matrix (ECM) is created randomly based on an elliptic curve group to modify the elliptic curve-discrete logarithm (EC-DL) cryptosystems, which are elliptic Diffie-Hellman key exchange (DHKE) and elliptic ElGamal public key cryptosystem (EEPKC), and to increase the security level in comparison with the original EC-DL schemes. In proposed schemes, the keys and ciphertext are computed using the ECMs. The security of trust schemes depended on the difficulty of solving the elliptic curve discrete logarithm problem (ECM-DLP). New experimental results on proposed schemes are discussed. The ECM-DL schemes consider new insights for more secure communications.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Discrete Mathematical Sciences and Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47974/jdmsc-1616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An elliptic curve matrix (ECM) is created randomly based on an elliptic curve group to modify the elliptic curve-discrete logarithm (EC-DL) cryptosystems, which are elliptic Diffie-Hellman key exchange (DHKE) and elliptic ElGamal public key cryptosystem (EEPKC), and to increase the security level in comparison with the original EC-DL schemes. In proposed schemes, the keys and ciphertext are computed using the ECMs. The security of trust schemes depended on the difficulty of solving the elliptic curve discrete logarithm problem (ECM-DLP). New experimental results on proposed schemes are discussed. The ECM-DL schemes consider new insights for more secure communications.
群环上的椭圆曲线矩阵改进椭圆曲线-离散对数密码体制
基于椭圆曲线群随机生成椭圆曲线矩阵(ECM),对椭圆型Diffie-Hellman密钥交换(DHKE)和椭圆型ElGamal公钥密码体制(EEPKC)中的椭圆曲线离散对数(EC-DL)密码体制进行了改进,与原有的EC-DL方案相比,提高了安全性。在所提出的方案中,密钥和密文是使用ecm计算的。信任方案的安全性取决于椭圆曲线离散对数问题(ECM-DLP)的求解难度。讨论了所提方案的新实验结果。ECM-DL方案考虑了更安全通信的新见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信