分而治之Diffie-Hellman密钥协议通信复杂度的初步分析

{"title":"分而治之Diffie-Hellman密钥协议通信复杂度的初步分析","authors":"Muhammad Arzaki","doi":"10.12962/j24775401.v8i2.13414","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":357596,"journal":{"name":"International Journal of Computing Science and Applied Mathematics","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Elementary Analysis of the Communication Complexity of Divide-and-Conquer Diffie-Hellman Key Agreement Protocol\",\"authors\":\"Muhammad Arzaki\",\"doi\":\"10.12962/j24775401.v8i2.13414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":357596,\"journal\":{\"name\":\"International Journal of Computing Science and Applied Mathematics\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computing Science and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12962/j24775401.v8i2.13414\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computing Science and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12962/j24775401.v8i2.13414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}