To obtain access to full text of journal and articles you must register!
- Article name
- Post-quantum EDS scheme based on the computational complexity of restoring the parameters of a vector finite field
- Authors
- Moldovyan A. A., , maa1305@yandex.ru, St. Petersburg Electrotechnical Univeristy "LETI", St.-Petersburg, Russia
- Keywords
- information security / public-key cryptosystems / digital signature / post-quantum cryptography / multivariate cryptography / finite algebra / vector finite field
- Year
- 2023 Issue 4 Pages 20 - 26
- Code EDN
- OOCBPZ
- Code DOI
- 10.52190/2073-2600_2023_4_20
- Abstract
- A new method for constructing post-quantum digital signature algorithms is proposed, in which the public key is formed in the form of a set of polynomials that specify the cube operation in a finite vector field with secret parameters. The signature is calculated as a solution to a cubic equation in a finite vector field GF(qm), which requires knowledge of the parameters for specifying the field GF(qm) as an m-dimensional algebra over the field GF(q). The signature verification procedure S includes the calculation of the vector S3 + S and, when using a public key, does not require knowledge of the parameters for specifying the field GF(qm). A direct attack on the proposed digital signature scheme is to calculate the parameters for specifying a vector finite field. Performing the operation of extracting a root of the third degree by solving a system of power equations connected by the specified set of polynomials is not enough to forge a signature, since solving a cubic equation that includes a term of the first degree also requires performing operations of extracting square roots.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
