{"title":"广义Heisenberg群中受限共轭问题的PTIME解","authors":"Kenneth R. Blaney, Andrey Nikolaev","doi":"10.1515/gcc-2016-0003","DOIUrl":null,"url":null,"abstract":"Abstract We examine the Anshel–Anshel–Goldfeld key exchange protocol with a generalized Heisenberg group, Hm, as a platform. We show that subgroup-restricted simultaneous conjugacy search problem in Hm can be solved in quasi-quintic time, which allows the computation of the private keys of the parties.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"32 1","pages":"69 - 74"},"PeriodicalIF":0.1000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups\",\"authors\":\"Kenneth R. Blaney, Andrey Nikolaev\",\"doi\":\"10.1515/gcc-2016-0003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We examine the Anshel–Anshel–Goldfeld key exchange protocol with a generalized Heisenberg group, Hm, as a platform. We show that subgroup-restricted simultaneous conjugacy search problem in Hm can be solved in quasi-quintic time, which allows the computation of the private keys of the parties.\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"32 1\",\"pages\":\"69 - 74\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2016-0003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2016-0003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
Abstract We examine the Anshel–Anshel–Goldfeld key exchange protocol with a generalized Heisenberg group, Hm, as a platform. We show that subgroup-restricted simultaneous conjugacy search problem in Hm can be solved in quasi-quintic time, which allows the computation of the private keys of the parties.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
