洛伊德鲁密码系统的两处修改

IF 0.6 4区工程技术 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Applicable Algebra in Engineering Communication and Computing Pub Date : 2022-08-16 DOI:10.1007/s00200-022-00577-0

Wenshuo Guo, Fang-Wei Fu

{"title":"洛伊德鲁密码系统的两处修改","authors":"Wenshuo Guo, Fang-Wei Fu","doi":"10.1007/s00200-022-00577-0","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents two modifications for Loidreau’s cryptosystem, a rank metric-based cryptosystem constructed by using Gabidulin codes in the McEliece setting. Recently a polynomial-time key recovery attack was proposed to break this cryptosystem in some cases. To prevent this attack, we propose the use of subcodes to disguise the secret codes in Modification I. In Modification II, we choose a random matrix of low column rank to mix with the secret matrix. Our analysis shows that these two modifications can both resist the existing structural attacks. Furthermore, these modifications have a much more compact representation of public keys compared to Classic McEliece, which has been selected into the fourth round of the NIST-PQC project.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"35 5","pages":"647 - 665"},"PeriodicalIF":0.6000,"publicationDate":"2022-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two modifications for Loidreau’s code-based cryptosystem\",\"authors\":\"Wenshuo Guo, Fang-Wei Fu\",\"doi\":\"10.1007/s00200-022-00577-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper presents two modifications for Loidreau’s cryptosystem, a rank metric-based cryptosystem constructed by using Gabidulin codes in the McEliece setting. Recently a polynomial-time key recovery attack was proposed to break this cryptosystem in some cases. To prevent this attack, we propose the use of subcodes to disguise the secret codes in Modification I. In Modification II, we choose a random matrix of low column rank to mix with the secret matrix. Our analysis shows that these two modifications can both resist the existing structural attacks. Furthermore, these modifications have a much more compact representation of public keys compared to Classic McEliece, which has been selected into the fourth round of the NIST-PQC project.</p></div>\",\"PeriodicalId\":50742,\"journal\":{\"name\":\"Applicable Algebra in Engineering Communication and Computing\",\"volume\":\"35 5\",\"pages\":\"647 - 665\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Algebra in Engineering Communication and Computing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00200-022-00577-0\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-022-00577-0","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了对 Loidreau 密码系统的两种修改。Loidreau 密码系统是一种基于秩度量的密码系统，它是在 McEliece 设置中使用 Gabidulin 码构建的。最近有人提出了一种多项式时间密钥恢复攻击，可以在某些情况下破解这个密码系统。为了防止这种攻击，我们在 "修改 I "中提出了使用子码来伪装暗码的方法。我们的分析表明，这两种修改都能抵御现有的结构性攻击。此外，与入选 NIST-PQC 项目第四轮的经典 McEliece 相比，这些修改对公钥的表示更为紧凑。

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

查看原文本刊更多论文

Two modifications for Loidreau’s code-based cryptosystem

This paper presents two modifications for Loidreau’s cryptosystem, a rank metric-based cryptosystem constructed by using Gabidulin codes in the McEliece setting. Recently a polynomial-time key recovery attack was proposed to break this cryptosystem in some cases. To prevent this attack, we propose the use of subcodes to disguise the secret codes in Modification I. In Modification II, we choose a random matrix of low column rank to mix with the secret matrix. Our analysis shows that these two modifications can both resist the existing structural attacks. Furthermore, these modifications have a much more compact representation of public keys compared to Classic McEliece, which has been selected into the fourth round of the NIST-PQC project.

求助全文

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

来源期刊

Applicable Algebra in Engineering Communication and Computing 工程技术-计算机：跨学科应用

CiteScore

2.90

自引率

14.30%

发文量

审稿时长

>12 weeks

期刊介绍： Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems. Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal. On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.