为广义（L，G）代码寻找枚举器

IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS

AUTOMATIC CONTROL AND COMPUTER SCIENCES Pub Date : 2024-02-29 DOI:10.3103/S0146411623080187

I. K. Noskov, S. V. Bezzateev

{"title":"为广义（L，G）代码寻找枚举器","authors":"I. K. Noskov, S. V. Bezzateev","doi":"10.3103/S0146411623080187","DOIUrl":null,"url":null,"abstract":"The algorithm for finding the enumerators of degree 2 and higher for the generalized (L, G)‑code is presented. This algorithm makes it possible to enhance the rate of finding enumerators as distinct from the exhaustive search algorithm. It can be used to construct a modern variant of the McEliece cryptosystem. The presented solution is based on using the representation of the Galois field element via the function containing the coefficients of a smaller field. In addition, the results of comparison of the modern McEliece cryptosystem constructed based on the Goppa codes and generalized (L, G)-codes are presented.","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"922 - 927"},"PeriodicalIF":0.6000,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finding Enumerators for Generalized (L, G)-Code\",\"authors\":\"I. K. Noskov, S. V. Bezzateev\",\"doi\":\"10.3103/S0146411623080187\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The algorithm for finding the enumerators of degree 2 and higher for the generalized (L, G)‑code is presented. This algorithm makes it possible to enhance the rate of finding enumerators as distinct from the exhaustive search algorithm. It can be used to construct a modern variant of the McEliece cryptosystem. The presented solution is based on using the representation of the Galois field element via the function containing the coefficients of a smaller field. In addition, the results of comparison of the modern McEliece cryptosystem constructed based on the Goppa codes and generalized (L, G)-codes are presented.\",\"PeriodicalId\":46238,\"journal\":{\"name\":\"AUTOMATIC CONTROL AND COMPUTER SCIENCES\",\"volume\":\"57 8\",\"pages\":\"922 - 927\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-02-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC CONTROL AND COMPUTER SCIENCES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0146411623080187\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0146411623080187","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了为广义（L，G）代码寻找度数为 2 及以上的枚举器的算法。与穷举搜索算法不同的是，这种算法可以提高枚举器的寻找率。它可用于构建麦克埃利斯密码系统的现代变体。所提出的解决方案基于通过包含较小字段系数的函数来表示伽罗瓦字段元素。此外，还介绍了基于 Goppa 码和广义 (L, G) 码构建的现代 McEliece 密码系统的比较结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Finding Enumerators for Generalized (L, G)-Code

The algorithm for finding the enumerators of degree 2 and higher for the generalized (L, G)‑code is presented. This algorithm makes it possible to enhance the rate of finding enumerators as distinct from the exhaustive search algorithm. It can be used to construct a modern variant of the McEliece cryptosystem. The presented solution is based on using the representation of the Galois field element via the function containing the coefficients of a smaller field. In addition, the results of comparison of the modern McEliece cryptosystem constructed based on the Goppa codes and generalized (L, G)-codes are presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

AUTOMATIC CONTROL AND COMPUTER SCIENCES AUTOMATION & CONTROL SYSTEMS-

CiteScore

1.70

自引率

22.20%

发文量

期刊介绍： Automatic Control and Computer Sciences is a peer reviewed journal that publishes articles on• Control systems, cyber-physical system, real-time systems, robotics, smart sensors, embedded intelligence • Network information technologies, information security, statistical methods of data processing, distributed artificial intelligence, complex systems modeling, knowledge representation, processing and management • Signal and image processing, machine learning, machine perception, computer vision