Selection Strategy of F4-Style Algorithm to Solve MQ Problems Related to MPKC

Author:

Kurokawa Takashi12ORCID,Ito Takuma1,Shinohara Naoyuki1,Yamamura Akihiro2ORCID,Uchiyama Shigenori3

Affiliation:

1. Cybersecurity Research Institute, National Institute of Information and Communications Technology, Nukui-Kitamachi, Koganei City 184-8795, Japan

2. Graduate School of Engineering Science, Akita University, Tegatagakuen-machi, Akita City 010-8502, Japan

3. Graduate School of Science, Tokyo Metropolitan University, Minami-Osawa, Hachioji City 192-0397, Japan

Abstract

Multivariate public-key cryptosystems are potential candidates for post-quantum cryptography. The security of multivariate public-key cryptosystems relies on the hardness of solving a system of multivariate quadratic polynomial equations. Faugère’s F4 algorithm is one of the solution techniques based on the theory of Gröbner bases and selects critical pairs to compose the Macaulay matrix. Reducing the matrix size is essential. Previous research has not fully examined how many critical pairs it takes to reduce to zero when echelonizing the Macaulay matrix in rows. Ito et al. (2021) proposed a new critical-pair selection strategy for solving multivariate quadratic problems associated with encryption schemes. Instead, this paper extends their selection strategy for solving the problems associated with digital signature schemes. Using the OpenF4 library, we compare the software performance between the integrated F4-style algorithm of the proposed methods and the original F4-style algorithm. Our experimental results demonstrate that the proposed methods can reduce the processing time of the F4-style algorithm by up to a factor of about seven under certain specific parameters. Moreover, we compute the minimum number of critical pairs to reduce to zero and propose their extrapolation outside our experimental scope for further research.

Funder

Ministry of Internal Affairs and Communications

Publisher

MDPI AG

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Software

Reference51 articles.

1. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer;Shor;SIAM Rev.,1999

2. National Institute of Standards and Technology (2022, December 01). Post-Quantum Cryptography: Proposed Requirements and Evaluation Criteria, Available online: https://csrc.nist.gov/News/2016/Post-Quantum-Cryptography-Proposed-Requirements.

3. National Institute of Standards and Technology (2022, December 01). New Call for Proposals: Call for Additional: Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process, Available online: https://csrc.nist.gov/projects/pqc-dig-sig/standardization/call-for-proposals.

4. (2023, February 05). CRYSTALS, Cryptographic Suite for Algebraic Lattices. Available online: https://pq-crystals.org.

5. (2023, February 05). FALCON, Fast-Fourier Lattice-Based Compact Signatures over NTRU. Available online: https://pq-crystals.org.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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