Split logarithm problem and a candidate for a post-quantum signature scheme
-
Published:2022-07
Issue:2 (89)
Volume:30
Page:243-258
-
ISSN:1561-4042
-
Container-title:Computer Science Journal of Moldova
-
language:
-
Short-container-title:CSJM
Author:
Moldovyan A.A., ,Moldovyan N.A.,
Abstract
A new form of the hidden discrete logarithm problem, called split logarithm problem, is introduced as primitive of practical post-quantum digital signature schemes, which is characterized in using two non-permutable elements $A$ and $B$ of a finite non-commutative associative algebra, which are used to compute generators $Q=AB$ and $G=BQ$ of two finite cyclic groups of prime order $q$. The public key is calculated as a triple of vectors $(Y,Z,T)$: $Y=Q^x$, $Z=G^w$, and $T=Q^aB^{-1}G^b$, where $x$, $w$, $a$, and $b$ are random integers. Security of the signature scheme is defined by the computational difficulty of finding the pair of integers $(x,w)$, although, using a quantum computer, one can easily find the ratio $x/w\bmod q$.
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
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献