矩阵共轭的认证

Groups Complex. Cryptol. Pub Date : 2010-10-24 DOI:10.1515/GCC.2009.199

D. Grigoriev, V. Shpilrain

{"title":"矩阵共轭的认证","authors":"D. Grigoriev, V. Shpilrain","doi":"10.1515/GCC.2009.199","DOIUrl":null,"url":null,"abstract":"We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter would follow from solving the conjugacy search problem in the platform (noncommutative) semigroup, i.e., to recovering X from X –1 AX and A. The platform semigroup that we suggest here is the semigroup of n × n matrices over truncated multivariable polynomials over a ring.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"Authentication from Matrix Conjugation\",\"authors\":\"D. Grigoriev, V. Shpilrain\",\"doi\":\"10.1515/GCC.2009.199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter would follow from solving the conjugacy search problem in the platform (noncommutative) semigroup, i.e., to recovering X from X –1 AX and A. The platform semigroup that we suggest here is the semigroup of n × n matrices over truncated multivariable polynomials over a ring.\",\"PeriodicalId\":119576,\"journal\":{\"name\":\"Groups Complex. Cryptol.\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complex. Cryptol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/GCC.2009.199\",\"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.2009.199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 32

摘要

我们提出了一种身份验证方案，在这种方案中，如果没有找到证明者的长期私钥，伪造(又名冒充)似乎是不可行的。后者将从解决平台(非交换)半群中的共轭搜索问题开始，即从X -1 AX和a中恢复X。我们在这里提出的平台半群是在环上截断的多变量多项式上的n × n矩阵的半群。

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

查看原文

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

本刊更多论文

Authentication from Matrix Conjugation

We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter would follow from solving the conjugacy search problem in the platform (noncommutative) semigroup, i.e., to recovering X from X –1 AX and A. The platform semigroup that we suggest here is the semigroup of n × n matrices over truncated multivariable polynomials over a ring.

求助全文

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

来源期刊

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