{"title":"利用GM(1,1)网格平滑模型构建安全网络通信系统","authors":"Yi-Fung Huang, Kun-Li Wen","doi":"10.30016/JGS.200412.0002","DOIUrl":null,"url":null,"abstract":"In this paper, we combined the public key cryptograph system proposed by Diffie and Hellman, with the infinite generation keys based on GM(1, 1) model , which in grey system theory, to establish the GM(1, 1) meshsmooth model to construct secure network communication system. The whole mathematics concept is used finite original code to create an infinite variables code sequence, and got the code from the known secrete key. In this paper, we define two parameters: cryptography sequence ψ and 3(superscript rd) order symmetric group S3 and presented six cryptography models to contribute our system. According to the implement of real case, the secrete value is high to O(The equation is abbreviated) for public system, and it is hard to calculate the code sequence by the present computing ability. Therefore, to break into this system by mathematical formula is no way nowadays. Besides, to promote the efficiency, we also develop a toolbox, it can not only to decrease the calculation time, but also examine the reliability of our system.","PeriodicalId":50187,"journal":{"name":"Journal of Grey System","volume":"24 1","pages":"75-82"},"PeriodicalIF":1.0000,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Using GM(1, 1) Meshsmooth Model to Construct Secure Network Communication System\",\"authors\":\"Yi-Fung Huang, Kun-Li Wen\",\"doi\":\"10.30016/JGS.200412.0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we combined the public key cryptograph system proposed by Diffie and Hellman, with the infinite generation keys based on GM(1, 1) model , which in grey system theory, to establish the GM(1, 1) meshsmooth model to construct secure network communication system. The whole mathematics concept is used finite original code to create an infinite variables code sequence, and got the code from the known secrete key. In this paper, we define two parameters: cryptography sequence ψ and 3(superscript rd) order symmetric group S3 and presented six cryptography models to contribute our system. According to the implement of real case, the secrete value is high to O(The equation is abbreviated) for public system, and it is hard to calculate the code sequence by the present computing ability. Therefore, to break into this system by mathematical formula is no way nowadays. Besides, to promote the efficiency, we also develop a toolbox, it can not only to decrease the calculation time, but also examine the reliability of our system.\",\"PeriodicalId\":50187,\"journal\":{\"name\":\"Journal of Grey System\",\"volume\":\"24 1\",\"pages\":\"75-82\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2004-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Grey System\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.30016/JGS.200412.0002\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Grey System","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.30016/JGS.200412.0002","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Using GM(1, 1) Meshsmooth Model to Construct Secure Network Communication System
In this paper, we combined the public key cryptograph system proposed by Diffie and Hellman, with the infinite generation keys based on GM(1, 1) model , which in grey system theory, to establish the GM(1, 1) meshsmooth model to construct secure network communication system. The whole mathematics concept is used finite original code to create an infinite variables code sequence, and got the code from the known secrete key. In this paper, we define two parameters: cryptography sequence ψ and 3(superscript rd) order symmetric group S3 and presented six cryptography models to contribute our system. According to the implement of real case, the secrete value is high to O(The equation is abbreviated) for public system, and it is hard to calculate the code sequence by the present computing ability. Therefore, to break into this system by mathematical formula is no way nowadays. Besides, to promote the efficiency, we also develop a toolbox, it can not only to decrease the calculation time, but also examine the reliability of our system.
期刊介绍:
The journal is a forum of the highest professional quality for both scientists and practitioners to exchange ideas and publish new discoveries on a vast array of topics and issues in grey system. It aims to bring forth anything from either innovative to known theories or practical applications in grey system. It provides everyone opportunities to present, criticize, and discuss their findings and ideas with others. A number of areas of particular interest (but not limited) are listed as follows:
Grey mathematics-
Generator of Grey Sequences-
Grey Incidence Analysis Models-
Grey Clustering Evaluation Models-
Grey Prediction Models-
Grey Decision Making Models-
Grey Programming Models-
Grey Input and Output Models-
Grey Control-
Grey Game-
Practical Applications.