Reed-Muller码的一维子码的Hadamard产品分类

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2022-10-01 DOI:10.1515/dma-2022-0025

I. Chizhov, M. Borodin

{"title":"Reed-Muller码的一维子码的Hadamard产品分类","authors":"I. Chizhov, M. Borodin","doi":"10.1515/dma-2022-0025","DOIUrl":null,"url":null,"abstract":"Abstract For Reed–Muller codes we consider subcodes of codimension 1. A classification of Hadamard products of such subcodes is obtained. With the use of this classification it has been shown that in most cases the problem of recovery of the secret key of a code-based cryptosystem employing such subcodes is equivalent to the problem of recovery of the secret key of the same cryptosystem based on Reed–Muller codes, which is known to be tractable.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Classification of Hadamard products of one-codimensional subcodes of Reed–Muller codes\",\"authors\":\"I. Chizhov, M. Borodin\",\"doi\":\"10.1515/dma-2022-0025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract For Reed–Muller codes we consider subcodes of codimension 1. A classification of Hadamard products of such subcodes is obtained. With the use of this classification it has been shown that in most cases the problem of recovery of the secret key of a code-based cryptosystem employing such subcodes is equivalent to the problem of recovery of the secret key of the same cryptosystem based on Reed–Muller codes, which is known to be tractable.\",\"PeriodicalId\":11287,\"journal\":{\"name\":\"Discrete Mathematics and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/dma-2022-0025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2022-0025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

对于Reed-Muller码，我们考虑余维数为1的子码。得到了这种子码的Hadamard产品的分类。使用这种分类表明，在大多数情况下，使用这种子码的基于代码的密码系统的密钥恢复问题相当于基于里德-穆勒码的相同密码系统的密钥恢复问题，这是已知的可处理的。

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

查看原文本刊更多论文

Classification of Hadamard products of one-codimensional subcodes of Reed–Muller codes

Abstract For Reed–Muller codes we consider subcodes of codimension 1. A classification of Hadamard products of such subcodes is obtained. With the use of this classification it has been shown that in most cases the problem of recovery of the secret key of a code-based cryptosystem employing such subcodes is equivalent to the problem of recovery of the secret key of the same cryptosystem based on Reed–Muller codes, which is known to be tractable.

求助全文

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

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.