在群环上使用矩阵进行公钥交换

Groups Complex. Cryptol. Pub Date : 2013-02-06 DOI:10.1515/gcc-2013-0007

Delaram Kahrobaei, Charalambos Koupparis, V. Shpilrain

{"title":"在群环上使用矩阵进行公钥交换","authors":"Delaram Kahrobaei, Charalambos Koupparis, V. Shpilrain","doi":"10.1515/gcc-2013-0007","DOIUrl":null,"url":null,"abstract":"Abstract. We offer a public key exchange protocol in the spirit of Diffie–Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This “nested structure” of the platform makes computation very efficient for legitimate parties. We discuss security of this scheme by addressing the Decision Diffie–Hellman (DDH) and Computational Diffie–Hellman (CDH) problems for our platform.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"145 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"78","resultStr":"{\"title\":\"Public key exchange using matrices over group rings\",\"authors\":\"Delaram Kahrobaei, Charalambos Koupparis, V. Shpilrain\",\"doi\":\"10.1515/gcc-2013-0007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract. We offer a public key exchange protocol in the spirit of Diffie–Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This “nested structure” of the platform makes computation very efficient for legitimate parties. We discuss security of this scheme by addressing the Decision Diffie–Hellman (DDH) and Computational Diffie–Hellman (CDH) problems for our platform.\",\"PeriodicalId\":119576,\"journal\":{\"name\":\"Groups Complex. Cryptol.\",\"volume\":\"145 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-02-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"78\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complex. Cryptol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2013-0007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complex. Cryptol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2013-0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 78

摘要

摘要我们以Diffie-Hellman的精神提供了一个公钥交换协议，但是我们使用(小)对称群环上的(小)矩阵作为平台。平台的这种“嵌套结构”使得合法各方的计算非常高效。我们通过解决我们平台上的决策Diffie-Hellman (DDH)和计算Diffie-Hellman (CDH)问题来讨论该方案的安全性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Public key exchange using matrices over group rings

Abstract. We offer a public key exchange protocol in the spirit of Diffie–Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This “nested structure” of the platform makes computation very efficient for legitimate parties. We discuss security of this scheme by addressing the Decision Diffie–Hellman (DDH) and Computational Diffie–Hellman (CDH) problems for our platform.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Groups Complex. Cryptol.

自引率

0.00%

发文量

期刊最新文献

On the intersection of subgroups in free groups: Echelon subgroups are inert On the dimension of matrix representations of finitely generated torsion free nilpotent groups Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem Non-associative key establishment for left distributive systems Generic complexity of the Diophantine problem