title: Candidate for practical post-quantum signature scheme
metadata.name: dc.contributor.author
metadata.value: Moldovyan, Nikolay A.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Moldovyan, Alexandr A.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2021-01-19T13:57:26Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2021-01-19T13:57:26Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2020-12
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Moldovyan N. A.,Moldovyan A. A. Candidate for practical post-quantum signature scheme. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2020, vol. 16, iss. 4, pp. 455–461.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2020.410
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/22460
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: A new criterion of post-quantum security is used to design a practical signature scheme
  based on the computational complexity of the hidden discrete logarithm problem. A 4-dimensional
  finite non-commutative associative algebra is applied as algebraic support of
  the cryptoscheme. The criterion is formulated as computational intractability of the
  task of constructing a periodic function containing a period depending on the discrete
  logarithm value. To meet the criterion, the hidden commutative group possessing the
  2-dimensional cyclicity is exploited in the developed signature scheme. The public-key
  elements are computed depending on two vectors that are generators of two different
  cyclic groups contained in the hidden group. When computing the public key two types
  of masking operations are used: i) possessing the property of mutual commutativity with
  the exponentiation operation and ii) being free of such property. The signature represents
  two integers and one vector S used as a multiplier in the verification equation. To prevent
  attacks using the value S as a fitting element the signature verification equation is doubled.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 16; Issue 4
metadata.lang: -
metadata.name: dc.subject
metadata.value: digital signature
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: post-quantum cryptoscheme
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: public key
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: hidden logarithm problem
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: finite non-commutative algebra
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: associative algebra
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Candidate for practical post-quantum signature scheme
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 455-461.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/22460/1/455-461.pdf
resources.format: Adobe PDF
resources.size: 243,88 kB