Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Post-quantum signature algorithms based on the hidden discrete logarithm problem
Authors: A.A. Moldovyan, N.A. Moldovyan
Keywords: 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.
– 0.11 Mb
Keywords: 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.
Abstract
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.St. Petersburg Institute for Informatics and Automation of
Russian Academy of Sciences
14 Liniya, 39, St.Petersburg, 199178
Russia
E-mail:
Russian Academy of Sciences
14 Liniya, 39, St.Petersburg, 199178
Russia
E-mail:
Fulltext
– 0.11 Mb
Contents
- A Short Introduction to Program Algebra with Instructions for Boolean Registers
- Imbrication algebras - algebraic structures of nesting order
- Closeness centrality in some splitting networks
- New Bounds for the Harmonic Energy and Harmonic Estrada index of Graphs
- Post-quantum signature algorithms based on the hidden discrete logarithm problem
- About Workshop in the framework of NIMSPPS project
