Edoardo Persichetti, T. Randrianarisoa, P. Santini
{"title":"基于代码等价的非交互式密钥交换攻击","authors":"Edoardo Persichetti, T. Randrianarisoa, P. Santini","doi":"10.2478/tmmp-2022-0018","DOIUrl":null,"url":null,"abstract":"Abstract A recent paper by Zhang and Zhang claims to construct the first code-based non-interactive key exchange protocol, using a modified version of the Code Equivalence Problem. In this paper we explain why this approach is flawed. Namely, we describe an attack which involves only linear algebra and completely breaks the protocol with overwhelming probability. A simple Magma script confirms our results.","PeriodicalId":38690,"journal":{"name":"Tatra Mountains Mathematical Publications","volume":"82 1","pages":"53 - 64"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Attack on a Non-Interactive Key Exchange from Code Equivalence\",\"authors\":\"Edoardo Persichetti, T. Randrianarisoa, P. Santini\",\"doi\":\"10.2478/tmmp-2022-0018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A recent paper by Zhang and Zhang claims to construct the first code-based non-interactive key exchange protocol, using a modified version of the Code Equivalence Problem. In this paper we explain why this approach is flawed. Namely, we describe an attack which involves only linear algebra and completely breaks the protocol with overwhelming probability. A simple Magma script confirms our results.\",\"PeriodicalId\":38690,\"journal\":{\"name\":\"Tatra Mountains Mathematical Publications\",\"volume\":\"82 1\",\"pages\":\"53 - 64\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tatra Mountains Mathematical Publications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/tmmp-2022-0018\",\"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":"Tatra Mountains Mathematical Publications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/tmmp-2022-0018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
An Attack on a Non-Interactive Key Exchange from Code Equivalence
Abstract A recent paper by Zhang and Zhang claims to construct the first code-based non-interactive key exchange protocol, using a modified version of the Code Equivalence Problem. In this paper we explain why this approach is flawed. Namely, we describe an attack which involves only linear algebra and completely breaks the protocol with overwhelming probability. A simple Magma script confirms our results.