A new type of digital signature algorithms with a hidden group
-
Published:2023-04
Issue:1(91)
Volume:31
Page:111-124
-
ISSN:1561-4042
-
Container-title:Computer Science Journal of Moldova
-
language:
-
Short-container-title:CSJM
Author:
Moldovyan Dmitriy N.ORCID
Abstract
The known designs of digital signature schemes with a hidden group, which use finite non-commutative algebras as algebraic support, are based on the computational complexity of the so-called hidden discrete logarithm problem. A similar design, used to develop a signature algorithm based on the difficulty of solving a system of many quadratic equations in many variables, is introduced. The significant advantage of the proposed method compared with multivariate-cryptography signature algorithms is that the said system of equations, which occurs as the result of performing the exponentiation operations in the hidden group, has a random look and is specified in a finite field of a higher order. This provides the ability to develop post-quantum signature schemes with significantly smaller public-key sizes at a given level of security.
Publisher
Vladimir Andrunachievici Institute of Mathematics and Computer Science
Subject
Artificial Intelligence,Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Networks and Communications,Computer Science Applications,Modeling and Simulation,Software
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献