.png){kind=icon}
Return
Enhancing data security using multivariate polynomial based McEliece encryption with advanced hash-based message authentication
.png){kind=icon}
PRE
AI
DOI：10.1007/s11416-026-00603-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
There have been a lot of new advances in public-key cryptography over the last few years. This paper proposes a novel Multivariate mapping, promotes the properties of Multivariate polynomials and designs an improved McEliece public-key cryptosystem by combining multivariate polynomials with Goppa polynomials. Based on error-correction algorithms, the McEliece public-key cryptosystem is designed to withstand quantum attacks. The proposed scheme that discretizes the multivariate mapping by partitioning the variable space into finite intervals over a finite field, enabling polynomial evaluations at discrete grid points. For instance, the code can be built by evaluating multivariate polynomials, which can be involved in the construction of the Goppa codes. The roots of the Goppa polynomial at a given position correspond to the proposed multivariate polynomial cryptosystem. Finally, messages encrypted with an improved McEliece cryptosystem are further authenticated using Hash-Based Message Authentication Codes (HMACs) based on the Keccak-256 hash function. This provides integrity and authentication by creating a unique hash of the encrypted data. Multivariate polynomials overcome the shortcomings such as large public key sizes, low efficiency, high complexity, and poor security in previous systems, while offering higher security and outperforming in secure communication and efficient transmission of messages for users. Overall, the proposed scheme demonstrates an overall encryption and decryption time of 2.713 ms and 1.162 ms, respectively, and storage efficiency of 98.12 kb when compared to state-of-the-art schemes.
Keywords:
Data security
Multivariate polynomial
McEliece public key cryptosystem
Quantum attack
Goppa polynomials
Post-quantum cryptography
And HMACs
Journal
J
IF:
1.9
Papers:
44
Citations:
0
Organization
Cited Papers
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process.png)
OAAI
IF0
OAAIShareSaveA Novel Quantum Hash-Based Attribute-Based Encryption Approach for Secure Data Integrity and Access Control in Mobile Edge Computing-Enabled Customer Behavior AnalysisIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveShareSaveShareSaveECA-VFog: An efficient certificateless authentication scheme for 5G-assisted vehicular fog computingPLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveQuantum Cryptanalysis Landscape of Shor’s Algorithm for Elliptic Curve Discrete Logarithm Problem
PREAI
ShareSave
View more