{"title":"The rise and resilience of multivariate cryptography: Advances, pitfalls, and promising pathways","authors":"Dheerendra Mishra, Kuldeep Namdeo, 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.
期刊介绍:
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.