Post-quantum signature algorithms based on the hidden discrete logarithm problem
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
139 5
Ultima descărcare din IBN:
2020-02-28 09:47
Căutarea după subiecte
similare conform CZU
512.545+519.71+004.056.5 (1)
Algebră (248)
Cibernetică matematică (69)
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (1462)
SM ISO690:2012
MOLDOVYAN, Alexandr; MOLDOVYAN, Nikolay. Post-quantum signature algorithms based on the hidden discrete logarithm problem. In: Computer Science Journal of Moldova. 2018, nr. 3(78), pp. 301-313. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF
BibTeX
DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 3(78) / 2018 / ISSN 1561-4042

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


CZU: 512.545+519.71+004.056.5
MSC 2010: 94A60, 16Z05, 14G50, 11T71, 16S50.
Pag. 301-313

Moldovyan Alexandr, Moldovyan Nikolay
 
St. Petersburg Institute for Informatics and Automation of Russian Academy of Sciences
 
Disponibil în IBN: 1 decembrie 2018


Rezumat

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.

Cuvinte-cheie
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.