{"title":"基于线性秩码的类gpt公钥密码系统的安全性","authors":"A. Kshevetskiy","doi":"10.1109/IWSDA.2007.4408344","DOIUrl":null,"url":null,"abstract":"Recent structural attacks on the GPT cryptosystem and variants are reviewed. The equivalency of different forms of cryptosystems is shown and the general form for the purpose of cryptanalysis is stated. The published structural attacks are turned out to be either polynomial, or exponential, depending on parameters of the cryptosystem. The secure choice of parameters is suggested for avoiding polynomial attacks.","PeriodicalId":303512,"journal":{"name":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Security of GPT-like public-key cryptosystems based on linear rank codes\",\"authors\":\"A. Kshevetskiy\",\"doi\":\"10.1109/IWSDA.2007.4408344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent structural attacks on the GPT cryptosystem and variants are reviewed. The equivalency of different forms of cryptosystems is shown and the general form for the purpose of cryptanalysis is stated. The published structural attacks are turned out to be either polynomial, or exponential, depending on parameters of the cryptosystem. The secure choice of parameters is suggested for avoiding polynomial attacks.\",\"PeriodicalId\":303512,\"journal\":{\"name\":\"2007 3rd International Workshop on Signal Design and Its Applications in Communications\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 3rd International Workshop on Signal Design and Its Applications in Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA.2007.4408344\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA.2007.4408344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Security of GPT-like public-key cryptosystems based on linear rank codes
Recent structural attacks on the GPT cryptosystem and variants are reviewed. The equivalency of different forms of cryptosystems is shown and the general form for the purpose of cryptanalysis is stated. The published structural attacks are turned out to be either polynomial, or exponential, depending on parameters of the cryptosystem. The secure choice of parameters is suggested for avoiding polynomial attacks.