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

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

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 propo...

Full description

Bibliographic Details
Main Authors: A.A. Moldovyan, N.A. Moldovyan
Format: Article
Language:English
Published: Vladimir Andrunachievici Institute of Mathematics and Computer Science 2018-11-01
Series:Computer Science Journal of Moldova
Subjects:
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
Online Access:http://www.math.md/files/csjm/v26-n3/v26-n3-(pp301-313).pdf
Description
Summary: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 using locally 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.
ISSN:1561-4042

Similar Items