Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
930 75 |
Ultima descărcare din IBN: 2023-10-15 11:00 |
Căutarea după subiecte similare conform CZU |
512.545+519.71+004.056.5 (1) |
Algebră (410) |
Cibernetică matematică (94) |
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4184) |
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 DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 3(78) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 512.545+519.71+004.056.5 | ||||||
MSC 2010: 94A60, 16Z05, 14G50, 11T71, 16S50. | ||||||
Pag. 301-313 | ||||||
|
||||||
Descarcă PDF | ||||||
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. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Moldovyan, A.A.</dc:creator> <dc:creator>Moldovyan, N.A.</dc:creator> <dc:date>2018-11-15</dc:date> <dc:description xml:lang='en'><p>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.</p></dc:description> <dc:source>Computer Science Journal of Moldova 78 (3) 301-313</dc:source> <dc:subject>finite associative algebra</dc:subject> <dc:subject>non-commutative algebra</dc:subject> <dc:subject>global unit</dc:subject> <dc:subject>local unit</dc:subject> <dc:subject>right-side units</dc:subject> <dc:subject>local invertibility</dc:subject> <dc:subject>discrete logarithm problem</dc:subject> <dc:subject>public-key cryptoscheme</dc:subject> <dc:subject>Digital signature</dc:subject> <dc:subject>post-quantum cryptography.</dc:subject> <dc:title>Post-quantum signature algorithms based on the hidden discrete logarithm problem</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>