Post-quantum signature algorithms based on the hidden discrete logarithm problem

Computer Science Journal of Moldova

N.A. Moldovyan¹  A.A. Moldovyan¹ 

[1] St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, 14 Liniya, 39, St.Petersburg, 199178, Russia;

关键词: finite associative algebra;    non-commutative algebra;    global unit;    local unit;    right-side units;    local invertibility;    discrete logarithm problem;    public-key cryptoscheme;    digital signature;    post-quantum cryptography;   

DOI  :  

来源: DOAJ

【 摘 要 】

New options of the hidden discrete logarithm problem are proposed as cryptographic primitive of the post-quantum signature algorithms. Two signature schemes using computations in finite non-commutative algebras with associative multiplication operation are introduced. The main feature of the proposed signature algorithms consists in usinglocally invertible elements of algebras. Two different types of algebras are used: i) containing global bi-side unit and ii)containing a large set of global right-side units.

【 授权许可】

Unknown