{"title":"The Word and Conjugacy Problem for Shuffle Groups","authors":"Daniella Bak Shnaps","doi":"10.1515/GCC.2009.143","DOIUrl":null,"url":null,"abstract":"After reviewing the importance of the Word Problem and the Conjugacy Problem for group-based cryptosystems, this paper offers an efficient method for solving both problems in the Shuffle Group.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complex. Cryptol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/GCC.2009.143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
After reviewing the importance of the Word Problem and the Conjugacy Problem for group-based cryptosystems, this paper offers an efficient method for solving both problems in the Shuffle Group.