Progress in Multivariate Cryptography: Systematic Review, Challenges, and Research Directions

Author:

Dey Jayashree1ORCID,Dutta Ratna1ORCID

Affiliation:

1. Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India

Abstract

Multivariate Public Key Cryptosystem (MPKC) seem to be promising toward future digital security even in the presence of quantum adversaries. MPKCs derive their security from the difficulty of solving a random system of multivariate polynomial equations over a finite field, which is known to be an NP-hard problem. This article aims at presenting a comprehensive survey that covers multivariate public key encryption and signature schemes specifically targeting toward security, efficiency, and parameter choice. The survey starts by giving an overview of the existing security challenges which include structural attacks such as MinRank attack, differential attack , and finding Gröbner basis for direct attack , and so on. Additionally, it discusses the necessary algorithms for the implementation of the multivariate schemes. This study also compares the promising multivariate encryption and signature schemes. The critical open challenges that are reviewed in this survey will serve as a single comprehensive source of information on multivariate encryption and signature schemes and a ready reference for researchers working in this rising area of public key cryptography.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Reference118 articles.

1. Koichiro Akiyama, Yasuhiro Goto, and Hideyuki Miyake. 2009. An algebraic surface cryptosystem. In Proceedings of the International Workshop on Public Key Cryptography. Springer, 425–442.

2. Daniel Apon, Dustin Moody, Ray Perlner, Daniel Smith-Tone, and Javier Verbel. 2020. Combinatorial rank attacks against the rectangular simple matrix encryption scheme. In Proceedings of the International Conference on Post-Quantum Cryptography. Springer, 307–322.

3. Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, and Jean-Pierre Tillich. 2020. An algebraic attack on rank metric code-based cryptosystems. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 64–93.

4. Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, and Javier Verbel. 2020. Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security. Springer, 507–536.

5. Factoring polynomials over finite fields;Berlekamp Elwyn R.;Bell System Technical Journal,1967

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3