{"title":"针对非对称密钥交换协议的被动攻击","authors":"Yunfei Cao, Jian Bai","doi":"10.1109/CSMA.2015.16","DOIUrl":null,"url":null,"abstract":"Constructing key exchange protocols which can resist the quantum-attack is a hot topic. In China Crypt2014, S. Mao et al claimed a new quantum-resistant key exchange protocol and also recommended a set of practical parameter. In this paper, we present a passive attack against this key exchange protocol. Specifically, an eavesdropper can recover the exchange key in polynomial time provided with an oracle solving the discrete logarithm problem. Particularly, this key exchange protocol with the recommended parameter can be attacked by a polynomial time algorithm.","PeriodicalId":205396,"journal":{"name":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Passive Attack against an Asymmetric Key Exchange Protocol\",\"authors\":\"Yunfei Cao, Jian Bai\",\"doi\":\"10.1109/CSMA.2015.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constructing key exchange protocols which can resist the quantum-attack is a hot topic. In China Crypt2014, S. Mao et al claimed a new quantum-resistant key exchange protocol and also recommended a set of practical parameter. In this paper, we present a passive attack against this key exchange protocol. Specifically, an eavesdropper can recover the exchange key in polynomial time provided with an oracle solving the discrete logarithm problem. Particularly, this key exchange protocol with the recommended parameter can be attacked by a polynomial time algorithm.\",\"PeriodicalId\":205396,\"journal\":{\"name\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSMA.2015.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSMA.2015.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Passive Attack against an Asymmetric Key Exchange Protocol
Constructing key exchange protocols which can resist the quantum-attack is a hot topic. In China Crypt2014, S. Mao et al claimed a new quantum-resistant key exchange protocol and also recommended a set of practical parameter. In this paper, we present a passive attack against this key exchange protocol. Specifically, an eavesdropper can recover the exchange key in polynomial time provided with an oracle solving the discrete logarithm problem. Particularly, this key exchange protocol with the recommended parameter can be attacked by a polynomial time algorithm.