The rise and resilience of multivariate cryptography: Advances, pitfalls, and promising pathways

IF 17.5 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-11-26 DOI:10.1016/j.cosrev.2025.100860
Dheerendra Mishra, Kuldeep Namdeo, Namita Srivastava
{"title":"The rise and resilience of multivariate cryptography: Advances, pitfalls, and promising pathways","authors":"Dheerendra Mishra,&nbsp;Kuldeep Namdeo,&nbsp;Namita Srivastava","doi":"10.1016/j.cosrev.2025.100860","DOIUrl":null,"url":null,"abstract":"<div><div>Multivariate Public Key Cryptography (MPKC) offers a robust framework for secure communications in the post-quantum era by harnessing the complexity of solving multivariate quadratic polynomial equations over finite fields. This inherent difficulty not only delivers strong quantum resistance but also supports high-security applications and additional functionalities. However, these advantages come with notable trade-offs, including larger key sizes and sophisticated security evaluations. In this paper, we present a comprehensive survey of MPKC, beginning with its mathematical foundations illustrated through accessible examples and an introduction to the essential terminology and core algorithms, such as Grobner basis methods, the Berlekamp algorithm, and extended-linearization methods, etc., that underpin effective implementations.</div><div>Our work critically examines state-of-the-art encryption and signature schemes, covering approaches inspired by Oil–Vinegar, Rainbow, and HFE-based constructions, as well as some essential designs like EFLASH, HFEv, Simple Matrix Encryption, and MAYO, etc. We review contemporary attack strategies including differential, rank, direct attacks, and physical attacks, and discuss how recent cryptanalytic breakthroughs (e.g., vulnerabilities revealed in Rainbow and UOV) underscore the need for more robust design choices. Furthermore, we highlight emerging research directions by exploring innovative techniques that integrate linear codes, neural network frameworks, employing other special polynomials, and novel algebraic constructions such as Sidon spaces and the Triple Unlocking Mechanism, alongside advanced signature variants like blind, ring, and proxy signatures. By synthesising theoretical insights with practical cryptanalysis, this survey not only identifies the current limitations, such as decryption failures, excessive key sizes, and susceptibilities to MinRank, reconciliation attacks, and other attacks, but also outlines future research challenges and requirements.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100860"},"PeriodicalIF":17.5000,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Review","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574013725001364","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/11/26 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Multivariate Public Key Cryptography (MPKC) offers a robust framework for secure communications in the post-quantum era by harnessing the complexity of solving multivariate quadratic polynomial equations over finite fields. This inherent difficulty not only delivers strong quantum resistance but also supports high-security applications and additional functionalities. However, these advantages come with notable trade-offs, including larger key sizes and sophisticated security evaluations. In this paper, we present a comprehensive survey of MPKC, beginning with its mathematical foundations illustrated through accessible examples and an introduction to the essential terminology and core algorithms, such as Grobner basis methods, the Berlekamp algorithm, and extended-linearization methods, etc., that underpin effective implementations.
Our work critically examines state-of-the-art encryption and signature schemes, covering approaches inspired by Oil–Vinegar, Rainbow, and HFE-based constructions, as well as some essential designs like EFLASH, HFEv, Simple Matrix Encryption, and MAYO, etc. We review contemporary attack strategies including differential, rank, direct attacks, and physical attacks, and discuss how recent cryptanalytic breakthroughs (e.g., vulnerabilities revealed in Rainbow and UOV) underscore the need for more robust design choices. Furthermore, we highlight emerging research directions by exploring innovative techniques that integrate linear codes, neural network frameworks, employing other special polynomials, and novel algebraic constructions such as Sidon spaces and the Triple Unlocking Mechanism, alongside advanced signature variants like blind, ring, and proxy signatures. By synthesising theoretical insights with practical cryptanalysis, this survey not only identifies the current limitations, such as decryption failures, excessive key sizes, and susceptibilities to MinRank, reconciliation attacks, and other attacks, but also outlines future research challenges and requirements.
多元密码学的兴起和弹性:进步、陷阱和有前途的途径
多变量公钥密码学(MPKC)通过利用在有限域上求解多变量二次多项式方程的复杂性,为后量子时代的安全通信提供了一个强大的框架。这种固有的困难不仅提供了强大的量子阻力,而且还支持高安全性应用程序和其他功能。然而,这些优势伴随着显著的权衡,包括更大的密钥大小和复杂的安全评估。在本文中,我们对MPKC进行了全面的调查,从其数学基础开始,通过可访问的示例说明,并介绍了基本术语和核心算法,如Grobner基方法,Berlekamp算法和扩展线性化方法等,这些都是有效实现的基础。我们的工作严格审查了最先进的加密和签名方案,涵盖了受油醋,彩虹和基于hfe的结构启发的方法,以及一些基本设计,如EFLASH, HFEv,简单矩阵加密和MAYO等。我们回顾了当代的攻击策略,包括差异,等级,直接攻击和物理攻击,并讨论了最近的密码分析突破(例如,在彩虹和UOV中发现的漏洞)如何强调需要更强大的设计选择。此外,我们通过探索整合线性代码、神经网络框架、采用其他特殊多项式和新的代数结构(如西顿空间和三重解锁机制)以及先进的签名变体(如盲签名、环签名和代理签名)的创新技术来强调新兴的研究方向。通过将理论见解与实际密码分析相结合,本调查不仅确定了当前的局限性,如解密失败、密钥大小过大、易受MinRank、和解攻击和其他攻击的影响,还概述了未来研究的挑战和要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Science Review
Computer Science Review Computer Science-General Computer Science
CiteScore
32.70
自引率
0.00%
发文量
26
审稿时长
51 days
期刊介绍: Computer Science Review, a publication dedicated to research surveys and expository overviews of open problems in computer science, targets a broad audience within the field seeking comprehensive insights into the latest developments. The journal welcomes articles from various fields as long as their content impacts the advancement of computer science. In particular, articles that review the application of well-known Computer Science methods to other areas are in scope only if these articles advance the fundamental understanding of those methods.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书