{"title":"组合公钥密码系统的密码分析","authors":"V. Roman’kov","doi":"10.1515/gcc-2017-0013","DOIUrl":null,"url":null,"abstract":"Abstract We discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger. We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion. As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"39 1","pages":"125 - 135"},"PeriodicalIF":0.1000,"publicationDate":"2017-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Cryptanalysis of a combinatorial public key cryptosystem\",\"authors\":\"V. Roman’kov\",\"doi\":\"10.1515/gcc-2017-0013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger. We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion. As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"39 1\",\"pages\":\"125 - 135\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2017-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2017-0013\",\"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-2017-0013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Cryptanalysis of a combinatorial public key cryptosystem
Abstract We discuss pitfalls in the security of the combinatorial public key cryptosystem based on Nielsen transformations inspired by the ElGamal cryptosystem proposed by Fine, Moldenhauer and Rosenberger. We introduce three different types of attacks to possible combinatorial public key encryption schemes and apply these attacks to the scheme corresponding to the cryptosystem under discussion. As a result of our observation, we show that under some natural assumptions the scheme is vulnerable to at least one of the proposed attacks.