Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/81782
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | N. H. Minh | - |
dc.contributor.author | D. N. Moldovyan | - |
dc.contributor.author | N. A. Moldovyan | - |
dc.contributor.author | A. A. Kostina | - |
dc.contributor.author | L..Q. Minh | - |
dc.contributor.author | L. H. Huong | - |
dc.contributor.author | N. L. Giang | - |
dc.date.accessioned | 2022-09-14T02:46:39Z | - |
dc.date.available | 2022-09-14T02:46:39Z | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 1813-9663 | - |
dc.identifier.uri | https://dspace.ctu.edu.vn/jspui/handle/123456789/81782 | - |
dc.description.abstract | A method for constructing a blind signature scheme based on a hidden discrete logarithm problem defined in finite non-commutative associative algebras is proposed. Blind signature protocols are constructed using four-dimensional and six-dimensional algebras defined over a ground finite field GF(p) and containing a global two-sided unit as an algebraic support. The basic properties of the used algebra, which determine the choice of protocol parameters, are described. | vi_VN |
dc.language.iso | en | vi_VN |
dc.relation.ispartofseries | Journal of Computer Science and Cybernetics;Vol.37, No.04 .- P.495-509 | - |
dc.subject | Information security | vi_VN |
dc.subject | Post-quantum cryptography | vi_VN |
dc.subject | Digital signature | vi_VN |
dc.subject | Blind signature | vi_VN |
dc.subject | Finite associative algebra | vi_VN |
dc.subject | Non-commutative algebra | vi_VN |
dc.title | Post-quantum blind signature protocol on non-commutative algebras | vi_VN |
dc.type | Article | vi_VN |
Appears in Collections: | Tin học và Điều khiển học (Journal of Computer Science and Cybernetics) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_file_ Restricted Access | 3.11 MB | Adobe PDF | ||
Your IP: 3.145.54.210 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.