基于广义Reed-Solomon码二值象的新码密码系统

F. Ivanov, E. Krouk, V. Zyablov
{"title":"基于广义Reed-Solomon码二值象的新码密码系统","authors":"F. Ivanov, E. Krouk, V. Zyablov","doi":"10.1109/REDUNDANCY52534.2021.9606467","DOIUrl":null,"url":null,"abstract":"McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new instance of McEliece cryptosystem that reduces a public key size. This cryptosystem is based on images of Generalized Reed-Solomon (GRS) codes. It was shown that in order to break the proposed system, intruder has to solve a decoding problem for a code that is not equivalent to private GRS code.","PeriodicalId":408692,"journal":{"name":"2021 XVII International Symposium \"Problems of Redundancy in Information and Control Systems\" (REDUNDANCY)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New Code-Based Cryptosystem Based on Binary Image of Generalized Reed-Solomon Code\",\"authors\":\"F. Ivanov, E. Krouk, V. Zyablov\",\"doi\":\"10.1109/REDUNDANCY52534.2021.9606467\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new instance of McEliece cryptosystem that reduces a public key size. This cryptosystem is based on images of Generalized Reed-Solomon (GRS) codes. It was shown that in order to break the proposed system, intruder has to solve a decoding problem for a code that is not equivalent to private GRS code.\",\"PeriodicalId\":408692,\"journal\":{\"name\":\"2021 XVII International Symposium \\\"Problems of Redundancy in Information and Control Systems\\\" (REDUNDANCY)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 XVII International Symposium \\\"Problems of Redundancy in Information and Control Systems\\\" (REDUNDANCY)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REDUNDANCY52534.2021.9606467\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 XVII International Symposium \"Problems of Redundancy in Information and Control Systems\" (REDUNDANCY)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REDUNDANCY52534.2021.9606467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

McEliece密码系统代表了一种基于任意线性代码解码的硬度的智能开放密钥系统,被认为能够抵抗量子计算机的出现。但是基于Goppa代码的原始McEliece密码系统在实践中的兴趣非常有限,部分原因是它需要一个非常大的公钥。在本文中,我们提出了一个新的McEliece密码系统实例,它减少了公钥的大小。该密码系统基于广义Reed-Solomon (GRS)码的图像。研究表明,为了破解该系统,入侵者必须解决一个不等同于私有GRS码的解码问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New Code-Based Cryptosystem Based on Binary Image of Generalized Reed-Solomon Code
McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new instance of McEliece cryptosystem that reduces a public key size. This cryptosystem is based on images of Generalized Reed-Solomon (GRS) codes. It was shown that in order to break the proposed system, intruder has to solve a decoding problem for a code that is not equivalent to private GRS code.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信