To obtain access to full text of journal and articles you must register!
- Article name
- Complexity evaluation of the parameters calculation algorithms in the signature scheme based on the hidden discrete logarithm problem
- Authors
- Abrosimov I. K., , ivnabr@yandex.ru, St. Petersburg Federal Research Center of the Russian Academy of Sciences (SPC RAS), Institute for Informatics and Automation of the Russian Academy of Sciences, St.-Petersburg, Russia
- Keywords
- post-quantum cryptography / electronic signature / finite non-commutative associative algebras / algorithm complexity
- Year
- 2020 Issue 3 Pages 22 - 28
- Code EDN
- Code DOI
- Abstract
- We consider computational algorithms over vectors of finite non-commutative associative algebras, the execution of which is required for the operation of the signature scheme based on the hidden problem of discrete logarithm. Formulas for evaluating algorithms complexity that used in the operation of the signature scheme are derived and on their basis, formulas for evaluating the procedures complexity for generating a public key, generating a signature and verifying a signature are obtained. The complexity of algorithms in multiplication operations of the field over which is given the algebra is measured.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
