{"title":"对密文的平均数量进行优化的密钥管理树，用于通信的频率分布","authors":"N. Ochiumi","doi":"10.55937/sut/1295467057","DOIUrl":null,"url":null,"abstract":"The average number of ciphertexts per one sessionT is an indicator of aptitude of a key-management tree T for a given frequency distribution of communication. In this paper, we estimate the weighted mean ofcT over all T 's with respect to appropriate weights as a criterion of aptitude of a key- management tree. We also give the concrete value of that mean in the case of equal weights.","PeriodicalId":38708,"journal":{"name":"SUT Journal of Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2010-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the average number of ciphertexts for the optimal key-management tree for a frequency distribution of communication\",\"authors\":\"N. Ochiumi\",\"doi\":\"10.55937/sut/1295467057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The average number of ciphertexts per one sessionT is an indicator of aptitude of a key-management tree T for a given frequency distribution of communication. In this paper, we estimate the weighted mean ofcT over all T 's with respect to appropriate weights as a criterion of aptitude of a key- management tree. We also give the concrete value of that mean in the case of equal weights.\",\"PeriodicalId\":38708,\"journal\":{\"name\":\"SUT Journal of Mathematics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SUT Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.55937/sut/1295467057\",\"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":"SUT Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55937/sut/1295467057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
On the average number of ciphertexts for the optimal key-management tree for a frequency distribution of communication
The average number of ciphertexts per one sessionT is an indicator of aptitude of a key-management tree T for a given frequency distribution of communication. In this paper, we estimate the weighted mean ofcT over all T 's with respect to appropriate weights as a criterion of aptitude of a key- management tree. We also give the concrete value of that mean in the case of equal weights.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
