{"title":"两个混沌系统的同步密钥交换","authors":"A. Eldin","doi":"10.1109/ICCES.2006.320444","DOIUrl":null,"url":null,"abstract":"In this paper, the idea of synchronization of two chaotic systems is used to solve the key exchange problem in cryptography. A proposal for a protocol is given and it is claimed that this method is simple and secure against known attack with the proof that the underlying chaotic systems model is a very hard problem to be solved, unlike the discrete logarithmic problem and other problems currently being used for key exchange which are only believed to be hard","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Key Exchange by Synchronization of two Chaotic Systems\",\"authors\":\"A. Eldin\",\"doi\":\"10.1109/ICCES.2006.320444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the idea of synchronization of two chaotic systems is used to solve the key exchange problem in cryptography. A proposal for a protocol is given and it is claimed that this method is simple and secure against known attack with the proof that the underlying chaotic systems model is a very hard problem to be solved, unlike the discrete logarithmic problem and other problems currently being used for key exchange which are only believed to be hard\",\"PeriodicalId\":261853,\"journal\":{\"name\":\"2006 International Conference on Computer Engineering and Systems\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Computer Engineering and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCES.2006.320444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Computer Engineering and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2006.320444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Key Exchange by Synchronization of two Chaotic Systems
In this paper, the idea of synchronization of two chaotic systems is used to solve the key exchange problem in cryptography. A proposal for a protocol is given and it is claimed that this method is simple and secure against known attack with the proof that the underlying chaotic systems model is a very hard problem to be solved, unlike the discrete logarithmic problem and other problems currently being used for key exchange which are only believed to be hard
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
