Quantum secure digital signature scheme based on multivariate quadratic quasigroups (MQQ)

In this paper, we propose a digital signature scheme, the MQQ-Sigv scheme, that relies on the difficulty of solving the multivariate quadratic (MQ) problem. The central map of the proposed scheme will be designed using the multivariate quadratic quasigroup (MQQ). We will prove that the MQQ-Sigv scheme is secure against various attacks including existential unforgeability under chosen message attack (EUF-CMA), Min-Rank attack, High-Rank attack, Direct attack, and Differential attack. Furthermore, we will prove that finding an equivalent good key for the MQQ-Sigv scheme is infeasible in polynomial time, and analyze the operating characteristics of the scheme.

Authors

Institutions

Publication Details

Journal
Advances in Mathematics of Communications
Published
2024-12-26
DOI
https://doi.org/10.3934/amc.2024057
Citations
1
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum secure digital signature scheme based on multivariate quadratic quasigroups (MQQ)

Indivar Gupta, Ashok Ji Gupta, Satish Kumar
1 citations
Advances in Mathematics of Communications
Polynomial and algebraic computation
0.36
article

Quantum secure digital signature scheme based on multivariate quadratic quasigroups (MQQ)

Indivar Gupta, Ashok Ji Gupta, Satish Kumar
article en
1 citations

Abstract

In this paper, we propose a digital signature scheme, the MQQ-Sigv scheme, that relies on the difficulty of solving the multivariate quadratic (MQ) problem. The central map of the proposed scheme will be designed using the multivariate quadratic quasigroup (MQQ). We will prove that the MQQ-Sigv scheme is secure against various attacks including existential unforgeability under chosen message attack (EUF-CMA), Min-Rank attack, High-Rank attack, Direct attack, and Differential attack. Furthermore, we will prove that finding an equivalent good key for the MQQ-Sigv scheme is infeasible in polynomial time, and analyze the operating characteristics of the scheme.

Advances in Mathematics of CommunicationsVol. 19(5)
Scientific Analysis Group (IN), Indian Institute of Technology BHU (IN), Banaras Hindu University (IN)
Openalex Percentile: Top 33%
Polynomial and algebraic computation
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.